1 solutions

  • 0
    @ 2025-6-7 14:59:11
    #include<bits/stdc++.h>
    using namespace std;
    const int N=110;
    int h[N],f[N],g[N];
    int main()
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++) cin>>h[i];
        for(int i=1;i<=n;i++)
        {
            f[i]=1;
            for(int j=1;j<i;j++)
                if(h[i]>h[j])
                    f[i]=max(f[i],f[j]+1);
        }
        for(int i=n;i>=1;i--)
        {
            g[i]=1;
            for(int j=n;j>i;j--)
                if(h[i]>h[j])
                    g[i]=max(g[i],g[j]+1);
        }
        int res=0;
        for(int i=1;i<=n;i++)
            res=max(res,g[i]+f[i]-1);
        cout<<n-res;
        return 0;
    }
    
    • 1

    Information

    ID
    978
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    5
    Tags
    (None)
    # Submissions
    28
    Accepted
    10
    Uploaded By