Submission #93834

#TimeUsernameProblemLanguageResultExecution timeMemory
93834dalgerokMoney (IZhO17_money)C++14
100 / 100
1391 ms58104 KiB
#include<bits/stdc++.h> using namespace std; const int N = 1e6 + 5; int n, a[N], ans; set < int > q; int main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin >> n; for(int i = 1; i <= n; i++){ cin >> a[i]; } for(int i = 1; i <= n; i++){ ans += 1; int j = i + 1; while(j <= n && a[j] >= a[j - 1]){ auto it = q.upper_bound(a[i]); if(it == q.end() || a[j] <= *it){ j += 1; } else{ break; } } //cout << i << " " << j << "\n"; for(int k = i; k < j; k++){ q.insert(a[k]); } i = j; i -= 1; } cout << ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...