Submission #473657

#	Time	Username	Problem	Language	Result	Execution time	Memory
473657		ogibogi2004	Money (IZhO17_money)	C++14	100 / 100	524 ms	15008 KiB

money

#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e6+6;
int dp[MAXN],n,a[MAXN],mappeda[MAXN];
int fen[MAXN];
void update(int idx,int val)
{
    for(;idx<MAXN;idx+=idx&(-idx))
    {
        fen[idx]+=val;
    }
}
int query(int idx)
{
    int ret=0;
    for(;idx>0;idx-=idx&(-idx))
    {
        ret+=fen[idx];
    }
    return ret;
}
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        update(a[i],+1);
    }
    int ans=1,last=a[n];
    for(int i=n;i>=1;i--)
    {
        if(i!=n&&a[i]>a[i+1])
        {
            ans++;
            last=a[i];
        }
        update(a[i],-1);
        if(query(last-1)-query(a[i])>0)
        {
            last=a[i];
            ans++;
        }
    }
    cout<<ans<<endl;
return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 16 / 16
• Subtask 3: 20 / 20
• Subtask 4: 55 / 55