239112026-01-31 17:36:27KristófDNScpp17Wrong answer 38/4012ms2292 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int tolt(char c)
{
int ans=0;
int sum=0;
vector<int> a(2*n+5,-1);
for(int i=0;i<n;i++)
    {
    if(s[i]==c)sum++;
    else sum--;
    if(a[sum+n]==-1)
        {
        a[sum+n]=i;
        ans=max(ans,i-a[sum+n]);
        }
    else ans=max(ans,i-a[sum+n]);
    }
return ans;
}

int main() {
    cin>>s;
    n=s.size();
    cout<<max(tolt('A'),max(tolt('C'),max(tolt('G'),tolt('T'))));
}
SubtaskSumTestVerdictTimeMemory
base38/40
1Accepted0/01ms316 KiB
2Accepted0/012ms2244 KiB
3Accepted2/21ms512 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms500 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted4/44ms820 KiB
9Accepted4/44ms1140 KiB
10Accepted4/46ms1272 KiB
11Accepted4/47ms1548 KiB
12Accepted4/47ms1732 KiB
13Accepted5/58ms2108 KiB
14Accepted5/58ms2292 KiB