# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166395 | abil | Money (IZhO17_money) | C++14 | 2 ms | 376 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 fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
#define int long long
using namespace std;
const int N = (1e6 + 12);
const int mod = (1e9 + 7);
const int INF = (1e15 + 9);
int t[N], a[N], n;
void update(int ind){
for(;ind <= n; ind = ind | (ind + 1)){
t[ind]++;
}
}
int get(int pos){
int res = 0;
for(;pos >= 1; pos = (pos & (pos + 1)) - 1){
res += t[pos];
}
return res;
}
main()
{
int ans = 0;
cin >> n;
for(int i = 1;i <= n; i++){
scanf("%lld", &a[i]);
}
ans++;
update(a[n]);
for(int i = n - 1;i >= 1; i--){
if(a[i] < a[i + 1]){
if(get(a[i + 1]) - get(a[i]) != a[i + 1] - a[i]){
ans++;
}
}
else{
ans++;
}
update(a[i]);
}
cout << 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... |