96pts,12tle 求调

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a, f[50005];
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a;
		f[i] = f[i - 1] + a;
	}
	for (int t = n; t >= 1; t--) {
		for (int i = 1; i <= n - t + 1; i++) {
			int j = i + t - 1;
			if ((f[j] - f[i - 1]) % 7 == 0) {
				cout << t;
				return 0;
			}
		}
	}
	cout << 0;
	return 0;
}