求每一位置的最大連續和，取最大的就好了
#include<iostream>using namespace std;int main(){ int N; cin >> N; for (int t = 1;t <= N;t++) { if (t != 1) putchar('/n'); printf("Case %d:/n", t); int M; cin >> M; int s_min=0, s_v=1; int s_max=-1001, s_h,s_l; int sum = 0; for (int i = 1;i <= M;i++) { int te;cin >> te; sum += te; if (sum - s_min >= s_max) { s_max = sum - s_min;s_h = i;s_l = s_v; } if (sum < s_min) { s_min = sum;s_v = i + 1; } } printf("%d %d %d/n", s_max, s_l, s_h); }}新聞熱點
疑難解答
