| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 37185 | Ulugbek_Abdimanabov | Money (IZhO17_money) | C++14 | 0 ms | 5924 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <bitset>
#define f first
#define s second
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
#define vi vector <int>
#define ld long double
#define pii pair<int, int>
#define y1 sda
using namespace std;    
const int N = int(1e6) + 10, mod = int(1e9)  + 7;
int n, a[N]; 
set <int> st;
set <int> :: iterator it;
int main () {
	freopen("money.in","r", stdin);
	freopen("money.out","w", stdout);
	scanf("%d",&n);
	for(int i = 0; i < n; i++){
		scanf("%d",&a[i]);
	}
	int i = 0, j = 0,mx ;
	int ans = 0;
	while(i < n){
		j = i;
		it = st.upper_bound(a[i]);
		if(it == st.end()){
			mx = mod;
		}
		else mx = *it;
		st.insert(a[i]);
		while(j + 1 < n && a[j + 1] >= a[j] && a[j + 1] <= mx){
			j++;
			st.insert(a[j]);
		}
		i = j + 1;
		ans++;
	}
	printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
