40分求调，全TLE

#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
int n, a[200005], v[200005], x, y, maxn = -inf;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		v[i] = v[i - 1] + a[i];
	}
	for (int t = 1; t <= n; t++) {
		for (int i = 1; i <= n - t + 1; i++) {
			int j = i + t - 1;
			maxn = max(maxn, v[j] - v[i - 1]);
		}
	}
	cout << maxn;
	return 0;
}