oj.uz

답안 #92643

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
92643 2019-01-04T09:15:09 Z janchomath Money (IZhO17_money) C++14
0 / 100
 2 ms 376 KB 
#include<bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n,a[2000005],ans,x;
set<ll>st;
set<ll>::iterator it;
int main(){
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> a[i];
	}
	
	for(int i=1; i<=n; i++){
		if(st.size()){
			if((*st.begin()) >= a[i]){
				x = (*st.begin());
			}
			else {
				it = st.lower_bound(a[i]);
				it++;
				if(it == st.end())x = 999999999999999;
				else x = (*it);
			}
		}
		else {
			x = 9999999999999;
		}
		
		ll l = i + 1;
		while(a[l] == a[l-1] && a[l] <= x){
			l++;
		}
		for(int j=i; j<l; j++){
			st.insert(a[j]);
		}
		i = l;
		ans++;
	}
	
	cout << ans;
	
	
	
	return 0;
}

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -