HDU1003 HDU1231 题意自明.可能是真的进步了点,记得刚开始研究这个问题时还想了好长时间,hdu 1231还手推了很长时间,今天重新写干净利落就AC了. #include<iostream> #include<cstring> #include<cstdio> #include<algorithm> using namespace std; ; int a[MAXN]; int main() { int T,N; scanf("%d&q…
http://acm.hdu.edu.cn/showproblem.php?pid=1231 最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23789 Accepted Submission(s): 10638 Problem Description 给定K个整数的序列{ N1, N2, ..., NK },其任意…
pid=1231">最大连续子序列 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18461 Accepted Submission(s): 8202 Problem Description 给定K个整数的序列{ N1, N2, ..., NK },其随意连续子序列可表示为{ Ni, Ni+1, ..., Nj },当中…
题目(1231) #include<stdio.h> #include<iostream> using namespace std; int main() { int K,num[10010],cnt; int end,start,thisMax,Max,temp; while(cin>>K&&K) { cnt=0; for( int i=0; i<K; i++) { scanf("%d",&num[i]); if(nu…