246682026-02-13 12:16:11algoproDNScpp17Wrong answer 38/4079ms10032 KiB
// UUID: 0837840c-9f45-4683-81d6-bbfbfa44917e
#include <bits/stdc++.h>
using namespace std;

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    int res = 0;
    for (char letter : {'C', 'T', 'A', 'G'}) {
        unordered_map<int, int> map;
        int pref = 0;
        map[0] = -1;
        for (int i = 0; i < n; i++) {
            if (letter == s[i]) pref++;
            else pref--;
            if (map.find(pref) == map.end()) {
                map[pref] = i;
            }else res = max(res, i - map[pref]);
        }
    }
    cout << res;
    return;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base38/40
1Accepted0/01ms316 KiB
2Accepted0/074ms5936 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted4/418ms1776 KiB
9Accepted4/429ms2792 KiB
10Accepted4/435ms3080 KiB
11Accepted4/445ms3692 KiB
12Accepted4/452ms6516 KiB
13Accepted5/571ms10032 KiB
14Accepted5/579ms9936 KiB