Submission #3570749


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;

//typedef pair<int,int> P;

int main(){
    int N;
    char s[101];

    scanf("%d",&N);
    scanf("%s",s);

    int x[101];
    x[0] = 0;
    for(int i=1;i<=N;i++){
        if(s[i-1]=='I') x[i] = x[i-1] + 1;
        if(s[i-1]=='D') x[i] = x[i-1] - 1;
    }

    int max = 0;
    for(int i=1;i<=N;i++){
        if(max<x[i]) max = x[i];
    }

    printf("%d\n",max);

    return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&N);
                   ^
./Main.cpp:20:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",s);
                  ^

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