Submission #1065631
Source Code Expand
n = int(input()) s = input() def caluculate_x(n, s): x = 0 x_list = [0] i = 0 while (i < n): if (s[i] == 'I'): x += 1 elif (s[i] == 'D'): x -= 1 x_list.append(x) i += 1 return x_list answer = max(caluculate_x(n, s)) print(answer)
Submission Info
Submission Time | |
---|---|
Task | B - Increment Decrement |
User | Albatross |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 360 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | 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 | 22 ms | 3064 KB |
sample_02.txt | AC | 22 ms | 3064 KB |
subtask_1_alld_01.txt | AC | 21 ms | 3064 KB |
subtask_1_alldmax_01.txt | AC | 22 ms | 3064 KB |
subtask_1_alli_01.txt | AC | 21 ms | 3064 KB |
subtask_1_allimax_01.txt | AC | 21 ms | 3064 KB |
subtask_1_max_01.txt | AC | 22 ms | 3064 KB |
subtask_1_max_02.txt | AC | 22 ms | 3064 KB |
subtask_1_rand_01.txt | AC | 22 ms | 3064 KB |
subtask_1_rand_02.txt | AC | 22 ms | 3064 KB |