| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1000303 | sofija6 | Money (IZhO17_money) | C++14 | 0 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>
#define ll long long
#define MAXN 1000010
using namespace std;
ll a[MAXN];
set<ll> s;
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,ans=0;
cin >> n;
for (ll i=1;i<=n;i++)
cin >> a[i];
for (ll i=1;i<=n;i++)
{
auto it=s.upper_bound(a[i]);
ans++;
while (a[i+1]>=a[i] && (it==s.end() || a[i+1]<=(*it)))
i++;
}
cout << ans;
return 0;
}
| # | 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... | ||||
