# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
92838 | SamAnd | Money (IZhO17_money) | C++17 | 254 ms | 14460 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 N = 1000006;
int n;
int a[N];
int t[N];
void ubd(int x)
{
while (x < N)
{
t[x]++;
x += (x & (-x));
}
}
int qry(int l, int r)
{
if (l > r)
return 0;
int ans = 0;
while (r > 0)
{
ans += t[r];
r -= (r & (-r));
}
--l;
while (l > 0)
{
ans -= t[l];
l -= (l & (-l));
}
return ans;
}
int main()
{
//freopen("input2.txt", "r", stdin);
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
int ans = 1;
ubd(a[1]);
int s = a[1];
map<int, int> mp;
for (int i = 2; i <= n; ++i)
{
ubd(a[i]);
if (a[i] >= a[i - 1] && qry(a[i - 1] + 1, a[i] - 1) == 0)
{
mp[a[i]]++;
if (a[i] == a[i - 1])
continue;
else
{
if (mp[a[i - 1]] == qry(a[i - 1], a[i - 1]))
continue;
else
{
if (a[i - 1] == s)
continue;
else
{
++ans;
s = a[i];
mp.clear();
mp[s]++;
}
}
}
}
else
{
++ans;
s = a[i];
mp.clear();
mp[s]++;
}
}
cout << ans << endl;
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... |