C++若干数据首尾相连构成环，找到连续4个数之和最大的一段

#include<iostream>
using namespace std;
int main() {
	int aa, i, n = 0, j, max = 1, s = 0;
	int a[20] = { 0 };
	cin >> aa;
	while (aa != -1) {
		a[n++] = aa;
		cin >> aa;
	}
	if (a[3] == 0) { cout << "invalid input"; return 0; }
	for (i = 0; i < n; i++) {
		s = a[i] + a[(i + 1) % n] + a[(i + 2) % n] + a[(i + 3) % n];
		if (s > max) { max = s; j = i; }
	}
	cout << j + 1 << " " << max;
	return 0;
}