제출 #344357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
344357		infertechno2	Money (IZhO17_money)	C++14	45 / 100	1603 ms	55660 KiB

money

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

    ll all_nums[1000001];

int main(){
    ll n,seg_count=1;
    cin>>n;
    for(ll i=0;i<n;i++){
        cin>>all_nums[i];
    }
    set<ll> segments_taken;
    segments_taken.insert(all_nums[0]);
    ll largest_note=1000001;
    for(ll i=1;i<n;i++){
        while(all_nums[i]<=largest_note and all_nums[i]>=all_nums[i-1] and i<n){
            segments_taken.insert(all_nums[i]);
            i++;
        }
        if(i!=n){
            seg_count++;
            //cout<<i<<" ";
            segments_taken.insert(all_nums[i]);
            if(segments_taken.upper_bound(all_nums[i])!=segments_taken.end()){
                largest_note=*segments_taken.upper_bound(all_nums[i]);
            }else{
                largest_note=1000001;
            }
        }
    }
    cout<<seg_count;
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 0 / 55