utoppia is another word .

题目描述： Doing Homework again Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3140    Accepted Submission(s): 1819 Problem Description

题目描述：  Dragons and Princesses Time limit per test: 2 second(s) Memory limit: 262144 kilobytes input: standard output: standard Once upon a time there lived the Knight. Being very cou

186. The Chain time limit per test: 0.5 sec. memory limit per test: 4096 KB input: standard input output: standard output Smith has N chains. Each chain is the sequence of successively

170. Particles time limit per test: 0.5 sec. memory limit per test: 4096 KB input: standard output: standard A new kind of elementary particles was discovered in recent physical experim

PRO IS HERE 其实只是简单的贪心即可，按(x,y) 排序，然后尽量取y大的。。。 #include #include #include #include #include #include #include #include using namespace std; #define PB push_back #define INS insert #define FOR(

POJ 2074 Line of Sight 线段相交 其实就是枚举障碍物的坐端点和房子的右端点   还有就是障碍的右端点和房子的左端点构成的直线和风景的交点对； 然后就是求这中间没有被覆盖的最长的长度。 #include #include #include #include #include #include using namespace std; #define FOR(i,a,b

按b从大到小排序。 #include #include #include #include #include using namespace std; #define nMax 100010 struct T{ int a,b; void read() { scanf("%d%d",&a,&b); } }; T s[nMax]; int cmp(T u,T v) { retu