Submission #1065612
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> #include <string> #define FOR(i,k,n) for((i)=(k);(i)<(n);(i)++) #define REP(i,n) for (int i=0;i<(n);i++) #define pb push_back #define all(a) (a).begin(),(a).end() //greater<int>() using namespace std; int main(){ int N,i,x,A; string S; cin>>N; cin>>S; x=0; A=0; REP(i,N){ if(S[i]=='I') x++; else if(S[i]=='D') x--; if(x>A) A=x; } cout<<A<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Increment Decrement |
User | taketakeken10 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 464 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 256 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 | 3 ms | 256 KB |
sample_02.txt | AC | 3 ms | 256 KB |
subtask_1_alld_01.txt | AC | 3 ms | 256 KB |
subtask_1_alldmax_01.txt | AC | 3 ms | 256 KB |
subtask_1_alli_01.txt | AC | 3 ms | 256 KB |
subtask_1_allimax_01.txt | AC | 3 ms | 256 KB |
subtask_1_max_01.txt | AC | 3 ms | 256 KB |
subtask_1_max_02.txt | AC | 3 ms | 256 KB |
subtask_1_rand_01.txt | AC | 3 ms | 256 KB |
subtask_1_rand_02.txt | AC | 3 ms | 256 KB |