摘要：
AssembleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 2578Accepted: 837DescriptionRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new computer.To make the ideal computer for your needs, yo 阅读全文
摘要：
Escape from Enemy TerritoryTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 2035Accepted: 581DescriptionA small group of commandos has infiltrated deep into enemy territory. They have just accomplished their mission and now have to return to their rendezvous point. Of course they don’t want 阅读全文
摘要：
POJ1469习惯性的不写return 0；这次尝到苦头了，很幸福的WA了……找了好久才知道是这个坏毛病……View Code 1 #include <cstdio> 2 #include <cmath> 3 #include <cstring> 4 #include <iostream> 5 #include <algorithm> 6 using namespace std; 7 const int M=300; 8 bool vis[M]; 9 bool bmap[M][M];10 int cx[M],cy[M];11 int 阅读全文
摘要：
POJ 拓扑排序题目总结1270 Following Orders给出一个字母表和一些字母对(char1,char2)表示char1一定要在char2前面。求出所有满足要求的排列，并按照字典序输出。这题一定要注意，字母表不一定是有序的，其实也就是注意要按照字典序输出即可。2585 Following Orders有一个4*4的矩形，然后有9个2*2的矩形，固定位置，固定编号，给出一个4*4矩形的状态图，问这种覆盖是否合法。根据小矩形上出现的数字判定矩形的先后性，然后判定是否存在拓扑序列。1128 Frame Stacking(the same as USACO Trainning frameu 阅读全文