# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
31729 | 2017-09-03T01:07:13 Z | simotion | Baloni (COCI15_baloni) | C++14 | 116 ms | 9828 KB |
#include <bits/stdc++.h> using namespace std; int inp[1000002],n,h[1000002],sum; int main() { scanf("%d",&n); for(int i=0;i<n;i++) scanf("%d",&inp[i]); sum++,h[inp[n-1]]++; for(int i=n-2;i>=0;i--) { if(h[inp[i]-1]) h[inp[i]-1]--; else sum++; h[inp[i]]++; } printf("%d",sum); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 9828 KB | Output is correct |
2 | Correct | 0 ms | 9828 KB | Output is correct |
3 | Correct | 0 ms | 9828 KB | Output is correct |
4 | Correct | 0 ms | 9828 KB | Output is correct |
5 | Correct | 96 ms | 9828 KB | Output is correct |
6 | Correct | 116 ms | 9828 KB | Output is correct |
7 | Correct | 93 ms | 9828 KB | Output is correct |
8 | Correct | 79 ms | 9828 KB | Output is correct |
9 | Correct | 116 ms | 9828 KB | Output is correct |
10 | Correct | 86 ms | 9828 KB | Output is correct |