oj.uz

답안 #887234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
887234 2023-12-14T06:28:37 Z vjudge1 Baloni (COCI15_baloni) C++17
100 / 100
 266 ms 10832 KB 
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
    const int lim=1e6+100;
#else
    const int lim=2e3+100;
#endif

#include "bits/stdc++.h"
using namespace std;

#define int int64_t
#define pb push_back

const int mod=1e9+7;
using pii=pair<int,int>;

inline void solve(){
    int n;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    multiset<int>all;
    for(int i=n-1;0<=i;i--){
        if(all.count(a[i]-1)){
            all.erase(all.find(a[i]-1));
        }
        all.insert(a[i]);
    }
    cout<<all.size()<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
#ifdef Local  
    freopen(".in","r",stdin);
    freopen(".out","w",stdout);
#else
    //freopen("grass.in","r",stdin);
    //freopen("grass.out","w",stdout);
#endif
    int t=1;
    //cin>>t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 215 ms 10056 KB Output is correct
6 Correct 266 ms 10832 KB Output is correct
7 Correct 220 ms 9392 KB Output is correct
8 Correct 214 ms 8788 KB Output is correct
9 Correct 219 ms 9556 KB Output is correct
10 Correct 238 ms 9904 KB Output is correct