Submission #1571850

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <array>
#include <vector>
#include <functional>
#include <unordered_map> 
#include <map> 
#include <numeric>
#include <limits>
#include <utility>
#include <queue>
#include <random>
using namespace std;
typedef long long LL;

int main(void) {
	int n, i, ans = 0, x = 0;
	string s;

	for (i - 0; i < n; i++) {
		if (s[i] == 'I') {
			x++;
		}
		else {
			x--;
		}
		ans = max(ans, x);
	}

	cout << ans << endl;

	return 0;
}

Submission Info

Judge Result