Submission #1045710

#	Time	Username	Problem	Language	Result	Execution time	Memory
1045710		ezzzay	Skyline (IZhO11_skyline)	C++14	100 / 100	54 ms	101212 KiB

skyline

#include<bits/stdc++.h>
using namespace std;
#define int  long long
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
vector<int>ans;
int a[N];
int dp[305][205][205];
signed main(){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=0;i<305;i++){
        for(int j=0;j<205;j++){
            for(int k=0;k<205;k++){
                dp[i][j][k]=1e9;
            }
        }
    }
    for(int i = 0;i<=a[1];i++)dp[2][a[1]-i][a[2]] = dp[1][0][a[1]-i] = i*3;
    for(int i=2;i<=n;i++){
        for(int j=a[i-1];j>=0;j--){
            for(int k=a[i];k>=0;k--){
                dp[i][j][k]=min(dp[i][j][k],dp[i][j][k+1]+3);
            }
        }
        for(int j=a[i-1];j>=0;j--){
            for(int k=a[i];k>=0;k--){
                dp[i][j][k]=min(dp[i][j][k],dp[i][j+1][k+1]+5);
            }
        }
        if(n==i)continue;
        for(int j=min({a[i],a[i-1],a[i+1]});j>=0;j--){
            for(int k=a[i];k>=j;k--){
                dp[i+1][k-j][a[i+1]-j]=min(dp[i+1][k-j][a[i+1]-j],dp[i][j][k] + j*7);
            }
        }
    }
    cout<<dp[n][0][0];
}

• Subtask 1: 100 / 100