hdoj 1003 Max Sum

再次鄙视一下hdoj的评测系统。。做这个花了我半个小时，原因：第一次提交WA，我死找问题，没找出，然后百度，发现原理都一样，然后又看，又想，结果把代码再交一次。。AC。。完全没修改。。。

//转移方程:ans[i] = max(a[i], ans[i - 1] + a[i]); #include <iostream> #include <cstring> #include <algorithm> #include <string> using namespace std; struct node { int sum; int _beg; int _end; }ans[100010]; int n; int main() { //freopen("1.txt", "r", stdin); int t; cin >> t; for(int i = 1; i <= t; i++) { if(i != 1) cout << endl; cin >> n; int data; ans[0].sum = 0; ans[0]._beg = ans[0]._end = 1; for(int j = 1; j <= n; j++) { cin >> data; ans[j].sum = data + ans[j - 1].sum; if(ans[j].sum < data) { ans[j].sum = data; ans[j]._beg = ans[j]._end = j; }else { ans[j]._beg = ans[j - 1]._beg; ans[j]._end = j; } } int index = 1; for(int j = 1; j <= n; j++) { if(ans[j].sum > ans[index].sum) index = j; } cout << "Case " << i << ":" << endl; cout << ans[index].sum << " " << ans[index]._beg << " " << ans[index]._end << endl; } return 0; }