Submission #2227457

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const ll mod = 1e9+7;

string X;
int main(){
    cin>>X;
    int ans=X.size();
    int tmp = 0;
    REP(i,0,X.size()){
        if(X[i]=='S'){
            tmp++;
        }else{
            if(tmp>0){
                ans-=2;
                tmp--;
            }
        }
    }
    p(ans);
    return 0;
}

Submission Info

Judge Result