Submission #284993

#TimeUsernameProblemLanguageResultExecution timeMemory
284993lukameladzeDischarging (NOI20_discharging)C++14
9 / 100
1086 ms8516 KiB
# include <bits/stdc++.h> using namespace std; long long b[1000005], n,a[1000005],mn,mx,raod,x,w; pair <long long ,long long > dp[1000005]; int main() { cin>>n; for (int i=1; i<=n; i++) { cin>>a[i]; } dp[0]={0,0}; dp[1]={a[1],a[1]}; for (int i=2; i<=n; i++) { dp[i].first=1e18; x=0; for (int j=i; j>=1; j--) { raod=i-j+1; x=max(x,a[j]); w=dp[j-1].second+x; if (dp[j-1].first+raod*w<dp[i].first) { dp[i].first=dp[j-1].first+raod*w; dp[i].second=w; } } } cout<<dp[n].first; }
#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...