| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 853422 | aymanrs | Money (IZhO17_money) | C++14 | 1 ms | 348 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<bits/stdc++.h>
using namespace std;
void solve(){
int n;
cin >> n;
int a[n];
int ans = 0;
set<int> s;
for(int i = 0;i < n;i++) cin >> a[i];
for(int i = 0;i < n;){
ans++;
int j = i;
for(;j < n && (j == i || a[j] >= a[j-1]) && s.lower_bound(a[i]) == s.lower_bound(a[j]);j++);
for(;i < j;i++) s.insert(a[i]);
}
cout << ans << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
}| # | 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... | ||||
