最大连续子序列.doc

Problem Description给定 K 个整数的序列 N1, N2, ., NK ，其任意连续子序列可表示为 Ni, Ni+1, ., Nj ，其中 1 #define M 10000using namespace std;int main()int T;int AM;while(cinT) int sum = -1;int m = 0,n = 0,l;if(T = M) exit(0);int b=-1;if(T != 0)for(int i = 0;i Ai)if(b 0) b += Ai;else b = Ai;l = i;if(b sum)sum = b;m = l;n = i;else exit(0);if(sum = 0) coutsum“ “Am“ “Anendl;else cout“0 “A0“ “AT-1endl;else exit(0);return 0;