206892026-01-08 17:41:49algoproDNScpp17Accepted 40/409ms4104 KiB
// UUID: 082442b2-bb2a-4663-a41d-3c29299cb876
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define pii pair<int, int>
#define pb push_back
#define srt(x) x.begin(),x.end()
const int INF = 1e9 + 7;

int ans = 1, n;
string s;

void calc(char c)
{
    int curr = 0;
    vector<int>m = {0};
    for(int i = 0; i < n; i++) 
    {
        curr += (s[i] == c ? 1 : -1);
        if(curr >= 0)
        {
            ans = max(ans, i+1);
            continue;
        }
        if(-curr == m.size()) m.push_back(i);
        else ans = max(ans, i - m[-curr]);
    }
}

signed main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
    cin >> s;
    n = s.size();
    calc('A');
    calc('C');
    calc('G');
    calc('T');
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/09ms2620 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted4/43ms1188 KiB
9Accepted4/44ms1380 KiB
10Accepted4/44ms1436 KiB
11Accepted4/46ms2208 KiB
12Accepted4/48ms3724 KiB
13Accepted5/58ms4004 KiB
14Accepted5/58ms4104 KiB