Submission #2114073

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;

int main(){
    string s;
    cin >> s;
    s.push_back('S');
    int count=0;
    int cs=0,ct=0;
    int t=0,l=0;
    for(int i=0;i<s.length();i++){
        if(s[i]=='S'){
            if(t==-1){
                l=min(cs,ct);
                count+=l;
                cs-=l;
                ct=0;
            }
            cs++;
            t=1;
        }
        if(s[i]=='T'){
            ct++;
            t=-1;
        }
    }
    cout << s.length()-count*2-1 << endl;
    return 0;
}

Submission Info

Judge Result