Submission #904474

---

Source Code Expand

#pragma comment(linker, "/STACK:64000000")
#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include <sstream>
#include <algorithm>
#include <functional>
#include <numeric>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

#define ft first
#define st second
#define mp make_pair
#define pb push_back
#define sz(n) int(n.size())
#define all(n) n.begin(), n.end()


using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

const int N = 1e5 + 123;
const int inf = 1e9 + 7;
const ll INF = 1e18 + 7;

string s;
int cnt [300], ans, balance ;

int main ()
{
    ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	  
	cin >> s;
	for (int i = 0; i < sz(s); i ++) 
	{
		if (s[i] == 'S') balance ++;
		else if (s[i] == 'T')
		{
			if (balance > 0) 
			{
				balance --;
				ans += 2;
			}
		}
	}                       

	cout << sz(s) - ans; 
}

Submission Info

Judge Result