Submission #1519338

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#define INF 1e+9
#define int long long
using namespace std;

signed main(){
	int ans = 0,a[100001],m = 0;
	string s;
	cin >> s;
	for(int i = 0;i < s.length();i++){
		if(s[i] == 'M') m++;
		else if(s[i] == '+') ans += m;
		else ans -= m;
	}
	a[s.length()] = 0;
	for(int i = s.length() - 1;i >= 0;i--){
		if(s[i] == '+') a[i] = a[i + 1] - 2;
		else if(s[i] == '-') a[i] = a[i + 1] + 2;
		else a[i] = a[i + 1];
	}
	for(int i = 0;i < s.length();i++){
		if(s[i] != 'M') a[i] = -INF;
	}
	sort(a,a + s.length(),greater<int>());
	for(int i = 0;i < m / 2;i++) ans += a[i];
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result