摘要：Degree Sequence of Graph GTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 651Accepted Submission(s): 243Problem DescriptionWang Haiyang is a strong and optimistic Chinese youngster. Although born and brought up in the northern inland city Harbin, h 阅读全文

摘要：Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.InputThe first line of the input contains an integer T(1<=T<=20) which means the number 阅读全文

摘要：饱尝情感苦恼的小Q本打算隐居一段时间，但仅仅在3月25号一天没有出现，就有很多朋友想念他，所以，他今天决定再出来一次，正式和大家做个告别。 小Q近来睡眠情况很差——晚上睡不着，早上又起不来！以前总是全勤的他这个月甚至迟到了好几次，虽然主管没说什么，但是他自己清楚此事的严重性。 爱情没有了，小Q不想再失去面包，于是他决定买个闹钟，为求质量可靠，特意挑了个最贵的原装进口货！但是，正所谓屋漏偏逢连夜雨、人倒霉的时候喝凉水都塞牙，小Q新买的这个进口闹钟竟然每分钟总是比正确时间慢那么几秒！ 可怜的小Ｑ愤愤然道：“真是一个大笨钟！” 但是为了充分利用大笨钟，小Q还是尽力想办法搞清楚它的性能，希... 阅读全文

摘要：不看不知道算几个数出来原来是斐波那契数列但是他是大数所以不要大意#include <cstdio>#include <cstring>#include <iostream>using namespace std;const int N=210;int a[N][N];void judge(){ int i = 0; int j = 0; a[1][0] = 1; a[2][0] = 2; for(i = 3; i < N-3; i++) { int k = 0; int t = 0; ... 阅读全文