Submission #1174938

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cassert>
#include<cstring>
#include<climits>
#include<sstream>
#include<deque>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<bitset>

#define REP(i,s,n) for(int i=s;i<n;++i)
#define rep(i,n) REP(i,0,n)

using namespace std;

typedef long long ll;

#define MAX 100010
string s;
int n,p[MAX],m[MAX];

int main() {
  cin >> s;
  n = (int)s.size();
  vector<int> score[2];
  for(int i=n-1;i>=0;--i) {
    if( i + 1 < n ) p[i] += p[i+1];
    if( s[i] == '-' ) --p[i];
    if( s[i] == '+' ) ++p[i];
  }
  for(int i=n-1;i>=0;--i) {
    if( i + 1 < n ) m[i] += m[i+1];
    if( s[i] == '-' ) ++m[i];
    if( s[i] == '+' ) --m[i];
  }
  rep(i,2) {
    rep(j,n) {
      if( s[j] == 'M' ) {
	if( i == 0 ) score[i].push_back(p[j]);
	else         score[i].push_back(m[j]);
      }
    }
    sort(score[i].begin(),score[i].end(),greater<int>());
  }
  int cnt = 0;
  rep(i,n) if( s[i] == 'M' ) ++cnt;
  cnt /= 2;
  int sum = 0;
  rep(i,2) rep(j,cnt) sum += score[i][j];
  cout << sum << endl;
  return 0;
}

Submission Info

Judge Result