Submission #1291866

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <deque>
#include <vector>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <cmath>

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

using namespace std;

int main(){
	int N;
	string S;
	int cnt = 0;
	int max = 0;
	cin >> N;
	cin >> S;

	for(int i = 0; i < N; i++){
		if(S[i] == 'I') cnt++;
		else cnt--;
		if(cnt > max) max = cnt;
	}
	cout << max << endl;
	return 0;
}

Submission Info

Judge Result