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>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define ll long long
#define ld long double
#define all(a) a.begin(),a.end()
#define ull unsigned long long
#define endl '\n'
#define y1 yaumru
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define iter vector<int>::iterator
#define int long long
using namespace std;
using namespace __gnu_pbds;
template<class T>
using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T>
using ordered_multiset=tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rnd1(chrono::steady_clock::now().time_since_epoch().count());
//find_by_order
//order_of_key
const int N=1e6+7;
const int inf=1e18+1e9;
const int mod=1e9+7;
const ld eps=1e-9;
int a[N];
int dp[N];
int t[N*63],l3[N*63],r3[N*63];
int all=0;
int root[N];
int vcopy(int v)
{
++all;
t[all]=t[v];
l3[all]=l3[v];
r3[all]=r3[v];
return all;
}
int get(int v,int l1,int r1,int l2,int r2)
{
if (l2>r2)return 0;
if (l1>r2 || r1<l2){
return 0;
}
if (l1>=l2 && r1<=r2){
return t[v];
}
int mid=(l1+r1)/2;
return (get(l3[v],l1,mid,l2,r2)+get(r3[v],mid+1,r1,l2,r2));
}
void update(int v,int l1,int r1,int pos,int x)
{
if (l1==r1){
t[v]+=x;
return;
}
int mid=(l1+r1)/2;
if (pos<=mid){
l3[v]=vcopy(l3[v]);
update(l3[v],l1,mid,pos,x);
}
else {
r3[v]=vcopy(r3[v]);
update(r3[v],mid+1,r1,pos,x);
}
t[v]=t[l3[v]]+t[r3[v]];
}
main ()
{
ios;
int n;
cin>>n;
for (int i=1;i<=n;++i){
cin>>a[i];
}
root[0]=vcopy(root[0]);
for (int i=1;i<=n;++i){
root[i]=vcopy(root[i-1]);
update(root[i],1,(int)1e6,a[i],1);
}
int ans=0;
for (int i=n;i>=1;--i){
int r=i-1;
while(r>=1 && a[r]<=a[r+1]){
bool cc=true;
if (get(root[r-1],1,(int)1e6,a[r]+1,a[i]-1)>0){
cc=false;
}
if (!cc){
break;
}
--r;
}
i=r+1;
++ans;
}
cout<<ans<<endl;
}
Compilation message (stderr)
money.cpp:83:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main ()
^
# | 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... |