p类型各题总结am.docVIP

最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11540 Accepted Submission(s): 4856 还需要输出该子序列的第一个和最后一个元素。 对每个测试用例，在1行里输出最大和、最大连续子序列的第一个和最后一个元 素，中间用空格分隔。如果最大连续子序列不唯一，则输山序号i和j最小的那个(如输入 样例的第2、3组)。若所有K个元素都是负数，则定义其最大和为0,输出整个序列的首尾 元素。 思路：一路加如果sum变成小于0 了从当前位置重新新开始加(小于0的话就对整个 段没有贡献了而II会使整个段的和变小) #includestdio.h int main() { int n，i，a[ 10005],start,end,sum,max,sta,flag,cnt; while(l) { cnt=0; sum=0;max=-1 ;flag=l; scanf(%d，n); if(n==0) return 0; for(i=0;in;i++) { scanf(%d”，a[i]); if(a[i]0) cnt++; if(a[i]==0) flag=0; } start=sta=end=a[O]; if((cnt==n||cnt==n-1)) { if(flag==0) {printf(’’O 0 0\nH); continue;} else if(n!=l) { printf(0 %d %d\n，a[0]，a[n-l]);continue;} } for(i=0;in;i++) sum=sum+a[i]; if(sum0i+1 n) sta=a[i+l]; sum=O; } else { if(summax) max=sum; end=a[i];start=sta; } } } printf(，o/od %d %d\n,max,start,end); } } Hdu 1087 super jumping 题意：此题就是找序列屮最大升序子序列的和。 可跳不一定非要连续 比如132屮升序序列有：{1} {3} {2} {1, 3} {1, 2}。所以最大为1+3=4; #includestdio.h _int64 a[1005],sum[1005]; int main() { int ij,n,max,ans; while(scanf(’’％d，n)n) { for(i=0;in;i++) {scanf(%I64d，a[i]);sum[i]=a[i];} ans=0; for(i=0;in;i++)//j 比 i 小 { for(j=0;ji;j++) { if(a[j]a[i]) sum[i]=sum[i](sum|j]+a[i])?sum[i]:(sum|j]+a[i]);//suin|j]之前已经求出 來了 } ans=ans〉sumfil?ans:sumfil; } printf(%d\n,ans); } return 0; } Common Subsequence Time Limit: 2000/1000ms (Java/Other) Memory Limit: 65536/32768K (Java/Other) Total Submission(s): 29 Accepted Submission(s): 16 Problem Description A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = xl，x2，…，xm another sequence Z = zl，z2，…，zk is a subsequence of X if there exists a strictly increasing sequence il，i2, ...，ik of indices of X such that for all j = 1，2，.，k，xij = zj. For example，Z = a，b，f，c〉is a subsequence of X = a，b，c，f，b， c with index sequence 1，2, 4, 6. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X a