# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
38623 | 2018-01-05T06:41:17 Z | Yusup01 | Money (IZhO17_money) | C++14 | 0 ms | 2564 KB |
#include<bits/stdc++.h> using namespace std; int i,jog=1,k,l,m,n,a[100009]; vector<int>b; int main() { ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n; for(int i=1; i<=n; i++) cin>>a[i]; for(i=1; i<=n; i++) { if(a[i]>=a[i-1]) b.push_back(a[i]); else break; } for(;i<=n; i++) { if(k==1) { for(int j=0; j<b.size(); j++) { if(a[i]<=b[j]) m=b[j]; } } b.clear(); b.push_back(a[i]); i++; if(a[i]<=m&&a[i]>=a[i-1]) {k=0; b.push_back(a[i]);} else {k=1; jog++;} } jog++; cout<<jog; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2564 KB | Output is correct |
2 | Correct | 0 ms | 2564 KB | Output is correct |
3 | Correct | 0 ms | 2564 KB | Output is correct |
4 | Incorrect | 0 ms | 2564 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2564 KB | Output is correct |
2 | Correct | 0 ms | 2564 KB | Output is correct |
3 | Correct | 0 ms | 2564 KB | Output is correct |
4 | Incorrect | 0 ms | 2564 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2564 KB | Output is correct |
2 | Correct | 0 ms | 2564 KB | Output is correct |
3 | Correct | 0 ms | 2564 KB | Output is correct |
4 | Incorrect | 0 ms | 2564 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 2564 KB | Output is correct |
2 | Correct | 0 ms | 2564 KB | Output is correct |
3 | Correct | 0 ms | 2564 KB | Output is correct |
4 | Incorrect | 0 ms | 2564 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |