# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335519 | luciocf | Money (IZhO17_money) | C++14 | 1 ms | 492 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;
const int maxn = 1e6+10;
int a[maxn];
int main(void)
{
int n;
scanf("%d", &n);
multiset<int> st;
for (int i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
st.insert(a[i]);
}
int ans = 0;
for (int r = n; r >= 1; r--)
{
++ans;
int l = r;
auto it = st.upper_bound(a[r]);
--it;
while (l > 1)
{
if (a[l-1] != *prev(it)) break;
it--, l--;
}
for (int i = r; i >= l; i--)
st.erase(st.find(a[i]));
r = l;
}
printf("%d\n", ans);
}
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... |