Submission #904962

---

Source Code Expand

#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <algorithm>
#include <functional>
#include <string>
#include <iostream>
#include <sstream>
#include <cmath>
#include <cstring>
using namespace std;

int main() {
    string X;
    cin >> X;
    int i, j, ct = 0, s2 = 0;
    for (i = 0; i < X.size(); i = j) {
        int s1 = 0, t1 = 0;
        for (j = i; j < X.size() && X[j] == 'S'; ++j)
            ++s1;
        for (; j < X.size() && X[j] == 'T'; ++j)
            ++t1;
        ct += abs(s1 + s2 - t1);
        if (s1 + s2 < t1) {
            s2 = 0;
        } else {
            s2 = s1 + s2 - t1;
        }
    }
    cout << ct << endl;
    return 0;
}

Submission Info

Judge Result