Submission #2076929

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

long long n, q, a[200009], p, s, maxn = -(1LL << 60);

int main() {
	cin >> n >> q;
	for (int i = 1; i <= n; i++) { cin >> a[i]; a[i + n] = a[i]; }
	for (int i = 1; i <= 2 * n; i++) a[i] += a[i - 1];
	maxn = a[n / 2];
	for (int i = 1; i <= q; i++) {
		cin >> p; p--; s += p; s %= n;
		maxn = max(maxn, a[s + n / 2] - a[s]);
	}
	cout << maxn << endl;
	return 0;
}

Submission Info

Judge Result