测试点#8 WA

测试点#1 #9 #10 #11RE

代码如下：

#include<bits/stdc++.h>
using namespace std;

int main() {
	
	int n, l[100001], r[100001], cntnan = 0, cntnv = 0, x, cha, sum = 0;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> x;
		if(x == 1) {
			cntnan++;
		} else {
			cntnv++;
		}
		cha = cntnv - cntnan + n;
		if(l[cha] == 0 && cha != n) {
			l[cha] = i;
		} else {
			r[cha] = i;
		}
	}
	for(int i = 1; i < 2 * n; i++) {
		sum = max(sum, r[i] - l[i]);
	}
	cout << sum;
	
	return 0;
}

求大佬指教谢谢Thanks♪(･ω･)ﾉ