摘要：
题目：ConstraintsTime Limit: 1 secs, Memory Limit: 256 MB , Special JudgeDescriptionThere are n children in a country marked by integers from 1 to n.They often fight with each other. For each pair of child A and child B, either A beats B or B beats A. It is not possible that both A beats B and B beats 阅读全文
摘要：
题目：DescriptionIt's Bessie's feeding time, and Farmer John is trying to decide where to put her. FJ has a farm that comprises W x H (1 2 #include 3 using namespace std; 4 5 #define MAX 750 6 7 struct Point{ 8 int x,y; 9 Point(int i,int j){10 x=i;11 y=j;12 }13 };14 15 v... 阅读全文