Codeforces Round 938 (Div. 3) E. Long Inversions

题目

思路：

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define fi first
#define se second
#define lson p << 1
#define rson p << 1 | 1
const int maxn = 1e6 + 5, inf = 1e18, maxm = 4e4 + 5;
const int N = (sqrt(1e5) + 1);
 const int mod = 1e9 + 7;
// const int mod = 998244353;
//const __int128 mod = 212370440130137957LL;
// int a[505][5005];
// bool vis[505][505];

int a[maxn], b[maxn];
bool vis[maxn];
string s;
int n, m;

struct Node{
    // int val, id;
    // bool operator<(const Node &u)const{
    //     return val < u.val;//!!!!!!!!!!!!!!!!!!
    // }
    int v, w;
};

//long long ? maxn ? n? m?


void solve(){
    int res = 0;
    int k;
    int x, y;
    cin >> n;
    vector<int> a(n + 5);
    for(int i = 1; i <= n; i++){
        char ch;
        cin >> ch;
        a[i] = ch - '0';
    }
    vector<int> tmp = a;
    for(int k = n; k >= 1; k--){
        vector<int> d(n + 5, 0);
        a = tmp;
        int cur, sum = 0;
        for(int i = 1; i + k <= n + 1; i++){
            sum += d[i];
            a[i] = a[i] ^ (sum % 2);
            if(a[i] == 0){
                d[i]++;
                d[i + k]--;
                sum++;
            }
            a[i] = 1;
        }
        for(int i = n - k + 2; i <= n; i++){
            sum += d[i];
            a[i] = a[i] ^ (sum % 2);
        }
        if(*min_element(a.begin() + 1, a.begin() + n + 1) == 1){
            cout << k << '\n';
            return;
        }
    }
}   
    
signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int T = 1;
    cin >> T;
    while (T--)
    {
        solve();
    }
    return 0;
}