Submission #1188078


Source Code Expand

import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		char[] S = sc.next().toCharArray();
 		int x = 0, max = 0;
		for(int i = 0; i < N; i++) {
			if(S[i] == 'I') {
				x++;
			}
			if(S[i] == 'D') {
				x--;
			}
			max = Math.max(max, x);
		}
		System.out.println(max);
	}

}

Submission Info

Submission Time
Task B - Increment Decrement
User ne280107
Language Java8 (OpenJDK 1.8.0)
Score 200
Code Size 456 Byte
Status AC
Exec Time 95 ms
Memory 23764 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 94 ms 21588 KB
sample_02.txt AC 95 ms 18004 KB
subtask_1_alld_01.txt AC 92 ms 19796 KB
subtask_1_alldmax_01.txt AC 93 ms 19284 KB
subtask_1_alli_01.txt AC 93 ms 18772 KB
subtask_1_allimax_01.txt AC 92 ms 21844 KB
subtask_1_max_01.txt AC 93 ms 21332 KB
subtask_1_max_02.txt AC 92 ms 19796 KB
subtask_1_rand_01.txt AC 93 ms 20564 KB
subtask_1_rand_02.txt AC 94 ms 23764 KB