A. Flipping Game

直接暴力枚举左右两端点即可

#include <iostream>
using namespace std;
const int N = 110;
int n;
int a[N],b[N];
int main () {
	cin >> n;
	for (int i = 1;i <= n;i++) cin >> a[i];
	int ans = 0;
	for (int i = 1;i <= n;i++) {
		for (int j = i;j <= n;j++) {
			for (int k = 1;k <= n;k++) {
				b[k] = a[k];
				if (i <= k && k <= j) b[k] ^= 1;
			}
			int cnt = 0;
			for (int k = 1;k <= n;k++) cnt += b[k];
			ans = max (ans,cnt);
		}
	}
	cout << ans << endl;
	return 0;
}