HDU ACM 1 1003 Max Sum

#include <iostream>#include <cmath>#include <algorithm>using namespace std;int main(){int K, y = 1;int Lu[100002], Hui;cin >> K;while (K--){int x = 0;int n;cin >> n;int left, right, a, b;for (int i = 1; i <= n; i++)cin >> Lu[i];Hui = Lu[1], a = b = left = right = 1;int Max = Lu[1];for (int i = 2; i <= n; i++){if (Hui >= 0){Hui += Lu[i];b = i;}if (Hui < 0){Hui = Lu[i];a = i;b = i;}if (Hui > Max){Max = Hui;left = a;right = b;}}if (Max == 0)left = right = 0;cout << "Case " << y++ << ":\n" << Max << ' ' << left << ' ' << right << endl;if (K > 0)cout << endl;}return 0;}