73472024-01-08 08:41:28anonDNScpp17Accepted 40/4012ms10472 KiB
#include <bits/stdc++.h>
#define FastIO ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
using namespace std;
typedef long long ll;
int main() {
    FastIO;
    ll i, j, cntr, ans, N;
    string dns;
    cin >> dns;
    N = dns.size();
    ans = 1;
    for(i = 0; i < 4; i++) {
        vector<ll> same(N * 2 + 1, -1);
        cntr = N;
        for(j = 0; j < N; j++) {
            cntr += (dns[j] == "ACGT"[i]) * 2 - 1;
            if(same[cntr] == -1)
                same[cntr] = j;
            else
                ans = max(ans, j - same[cntr]);
        }
        while(cntr > N) {
            cntr--;
            if(same[cntr] != -1)
                ans = max(ans, j - same[cntr]);
            j++;
        }
    }
    ans = min(ans, N);
    cout << ans << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1864 KiB
2Accepted0/012ms8892 KiB
3Accepted2/23ms2388 KiB
4Accepted2/23ms2460 KiB
5Accepted2/23ms2616 KiB
6Accepted2/23ms2844 KiB
7Accepted2/23ms2956 KiB
8Accepted4/44ms5068 KiB
9Accepted4/44ms6236 KiB
10Accepted4/46ms6972 KiB
11Accepted4/47ms7964 KiB
12Accepted4/47ms8408 KiB
13Accepted5/58ms9428 KiB
14Accepted5/58ms10472 KiB