Submission #1441303

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;

int main() {
    
    string X;
    cin >> X;
    
    long long count1, count2;
    count1 = count2 = 0;
    
    for ( int i = 0; i < X.length(); i++ ) {
        if ( X[i] == 'S' ) { break; }
        count1++;
    }
    
    for ( int i = X.length()-1; i >= 0 ; i-- ) {
        if ( X[i] == 'T' ) { break; }
        count2++;
    }
    
    
    cout << (  max(count1,count2)*2  ) << endl;
    
    
    return 0;
}

Submission Info

Judge Result