#include <iostream> #include <vector> #include <algorithm> using namespace std; int main() { int T; cin >> T; for (int i = 0; i < T; i++) { int n; cin >> n; vector<int> dp(n), a(n),N(n); for (int j = 0; j < n; j++) cin >> a[j]; dp[0] = a[0]; N[0] = 0; for (int j = 1; j < n; j++) { if (a[j]>dp[j - 1] + a[j]) { N[j] = 0; dp[j] = a[j]; } else { N[j] = N[j - 1] + 1; dp[j] = dp[j - 1] + a[j]; } } int maxD = dp[0]; int endA = 0; for (int j = 0; j < n; j++) if (maxD < dp[j]) { maxD = dp[j]; endA = j; } cout << "Case " << i + 1 << ":" << endl; cout << maxD << " "<<endA-N[endA]+1<<" "<<endA+1<<endl; if (i != T - 1) cout << endl; } return 0; }
杭电OJ 1003 求和最大连续子序列
猜你喜欢
转载自blog.csdn.net/fuwu4087/article/details/80715270
今日推荐
周排行