oj.uz

Submission #783825

# Submission time Handle Problem Language Result Execution time Memory
783825 2023-07-15T11:08:15 Z makanhulia Furniture (JOI20_furniture) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n,a[300005],dp[300005],suff[300005];
// bool kondisi[300005];
ll mod=1000000007;
int main(){
    a[0]=1e9;
    cin>>n;
    for (int i=1;i<=n;i++){
        cin>>a[i];
    }
    dp[0]=1;
    for (int i=1;i<=n;i++){
        for (int j=0;j<i;j++){
            ll u=min(a[j],a[i]);
            ll kondisi=0;
            for (int k=j+1;k<i;k++){
                if (a[k]<u) kondisi=1;
            }
            if (kondisi==0) {
                dp[i]+=dp[j];
                dp[i]=dp[i]%mod;
            }
        }
    }
    suff[n]=a[n];
    for (int i=n-1;i>=1;i--){
        suff[i]=min(suff[i+1],a[i]);
    }
    ll ans=0;
    for (int i=1;i<=n;i++){
        if (suff[i]==a[i]) ans+=dp[i];
        ans=ans%mod;
    }
    cout<<ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -