摘要：
题目描述有m个盒子，第i个盒子的长尾hi，宽为wi。如果两个盒子i,j满足hi#include#includeusing namespace std;const int maxn=20001;struct node{ int x,y;}box[maxn];int a[maxn];bool cm... 阅读全文
摘要：
题目描述After the hard tasks, It’s the easy time for Y.G.Tobor and Y.D.I.Isha is a friend of Y.D.I, as he thinks Tobor is smart too, he give Tobor a probl... 阅读全文
摘要：
题目描述ZZZis an enthusiasticACMerand he spends lots of time on training. He always stays up late for training. He needs enough time to sleep, and hates s... 阅读全文
摘要：
题目描述Farmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the ca... 阅读全文
摘要：
题目描述We often encounter sequence like this, 0, 1, 1, 2, 3, 5, 8, ... , which is called Fibonacci sequence. It's defined by the recurrence F[0] = 0 F[1]... 阅读全文
摘要：
题目描述 Given a sequence S[1..N], you are to rearrange the sequence so that it satisfies the following condition: for each i (1 #include#includeusing nam... 阅读全文