Submission #404532

#TimeUsernameProblemLanguageResultExecution timeMemory
404532FidiskDischarging (NOI20_discharging)C++14
36 / 100
1070 ms18316 KiB
#include <bits/stdc++.h>
using namespace std;

#define oo 1e15
#define fi first
#define se second
#define sp(iiii) setprecision(iiii)
#define IO ios_base::sync_with_stdio(false); cin.tie(0)
#define ms(aaaa,xxxx) memset(aaaa,xxxx,sizeof(aaaa))
#define cntbit(xxxx) __builtin_popcount(xxxx)
#define getbit(xxxx,aaaa) ((xxxx>>(aaaa-1))&1)

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pair<int,int>,int> piii;
typedef pair<long long,long long> pll;
typedef pair<pair<long long,long long>,long long> plll;
typedef pair<pair<long long,long long>,pair<long long,long long>> pllll;
typedef pair<pair<long long,long long>,bool> pllb;

const ll base=361;
const ll mod=998244353;
const ld eps=1e-5;
const ll maxn=1e6;

ll n,i,j,a[1000009],f[1000009];

int main(){
    IO;
    cin>>n;
    for (i=1;i<=n;i++) {
        cin>>a[i];
        a[i]=max(a[i-1],a[i]);
    }
    for (i=1;i<=n;i++) {
        f[i]=oo;
        for (j=0;j<i;j++) {
            f[i]=min(f[i],f[j]+a[i]*(n-j));
        }
    }
    cout<<f[n]<<'\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...