后面TLE的要用什么思路啊？

提交记录

#include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], n, nmax = 0;
int main(){
    scanf("%d", &n);
    for (int i = 1; i <= n; i++){
        scanf("%d", &a[i]);
        b[i] = b[i-1] + a[i];
    }
    for (int i = 1; i <= n; i++){
        for (int j = i; j <= n; j++){
            b[j] -= a[i-1];
            if (b[j] == (j - i + 1) * 0.5){
                nmax = max(nmax, j - i + 1);
            }
        }
    }
    printf("%d", nmax);
    return 0;
}