# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
700130 | messiuuuuu | Money (IZhO17_money) | C++14 | 159 ms | 14940 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 task "C"
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
using namespace std;
const int MAXN = 1e6 + 5;
const ll INF = 1e18 + 5;
int n;
int a[MAXN];
void Input()
{
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
}
struct BIT
{
int fe[MAXN];
void add(int id, int val)
{
for (; id <= 1e6; id += id & -id)
fe[id] += val;
}
int get(int l)
{
if (l < 0)
return 0;
int res = 0;
for (; l; l -= l & -l)
res += fe[l];
return res;
}
int get(int l, int r)
{
if (l > r)
return 0;
return get(r) - get(l - 1);
}
}bit;
void Solve()
{
int res = 1, pos = 1;
for (int i = 1; i < n; i++)
{
if (a[i] > a[i + 1])
{
res++;
while (pos <= i)
{
bit.add(a[pos], 1);
pos++;
}
}
if (a[i] < a[i + 1] && bit.get(a[pos] + 1, a[i + 1] - 1))
{
res++;
while (pos <= i)
{
bit.add(a[pos], 1);
pos++;
}
}
}
cout << res;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (fopen(task".INP","r"))
{
freopen(task".INP","r",stdin);
//freopen(task".OUT","w",stdout);
}
Input();
Solve();
}
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... |