oj.uz

답안 #165229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165229 2019-11-26T06:33:40 Z Atill83 Baloni (COCI15_baloni) C++14
100 / 100
 334 ms 3960 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 1e6+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n;
int h[MAXN];

multiset<int> st;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("../IO/int.txt","r",stdin);
        freopen("../IO/out.txt","w",stdout);
    #endif

    cin>>n;
    int ans = n;
    for(int i = 0; i < n; i++){
        cin>>h[i];
    }

    for(int i = 0; i < n; i++){
        auto a = st.lower_bound(h[i] + 1);
        if(a != st.end() && (*a) == h[i] + 1){
            st.erase(a);
            ans--;
        }
        st.insert(h[i]);
    }
    cout<<ans<<endl;
    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1
100.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 275 ms 3532 KB Output is correct
6 Correct 334 ms 3960 KB Output is correct
7 Correct 279 ms 3320 KB Output is correct
8 Correct 272 ms 3320 KB Output is correct
9 Correct 276 ms 3576 KB Output is correct
10 Correct 296 ms 3704 KB Output is correct