Submission #23,912

2026-01-31 17:37:33

cpp17

Accepted 40/40

13ms

2304 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]);
    }
if(sum>=0)return n;
return ans;
}

int main() {
    cin>>s;
    n=s.size();
    cout<<max(tolt('A'),max(tolt('C'),max(tolt('G'),tolt('T'))));
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	13ms	2244 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	4/4	4ms	820 KiB
		9	Accepted	4/4	4ms	1228 KiB
		10	Accepted	4/4	4ms	1404 KiB
		11	Accepted	4/4	8ms	1596 KiB
		12	Accepted	4/4	7ms	1732 KiB
		13	Accepted	5/5	8ms	2104 KiB
		14	Accepted	5/5	8ms	2304 KiB