Submission #1732486


Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#define	MOD = 1000000007;
using namespace std;

int main()
{
	int N;
	string S;

	cin >> N >> S;

	int c = 0;
	int max = 0;
	for (int i = 0; i < S.size(); i++)
	{
		if (S[i] == 'D')
		{
			c--;
		}
		else if (S[i] == 'I')
		{
			c++;
		}
		if (max < c)
		{
			max = c;
		}
	}

	cout << max << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Increment Decrement
User butanokakuni
Language C++14 (GCC 5.4.1)
Score 200
Code Size 403 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 2
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, subtask_1_alld_01.txt, subtask_1_alldmax_01.txt, subtask_1_alli_01.txt, subtask_1_allimax_01.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_alld_01.txt AC 1 ms 256 KB
subtask_1_alldmax_01.txt AC 1 ms 256 KB
subtask_1_alli_01.txt AC 1 ms 256 KB
subtask_1_allimax_01.txt AC 1 ms 256 KB
subtask_1_max_01.txt AC 1 ms 256 KB
subtask_1_max_02.txt AC 1 ms 256 KB
subtask_1_rand_01.txt AC 1 ms 256 KB
subtask_1_rand_02.txt AC 1 ms 256 KB