Submission #13294

#TimeUsernameProblemLanguageResultExecution timeMemory
13294gs14004Skyline (IZhO11_skyline)C++14
55 / 100
2000 ms51152 KiB
#include <cstdio>
#include <algorithm>
using namespace std;

int a[305],n;
int dp[305][205][205];

int main(){
    scanf("%d",&n);
    for (int i=0; i<n; i++) {
        scanf("%d",&a[i]);
    }
    for (int i=n-1; i>=0; i--) {
        for (int j=0; j<=a[i]; j++) {
            for (int k=0; k<=a[i+1]; k++) {
                dp[i][j][k] = 1e9;
                for (int l=0; l<=j && l<=k; l++) {
                    for (int m=0; m<=a[i+2] && m<=l; m++) {
                        dp[i][j][k] = min(dp[i][j][k],3 * j + 2 * l + 2 * m + dp[i+1][k-l][a[i+2]-m]);
                    }
                }
            }
        }
    }
    printf("%d",dp[0][a[0]][a[1]]);
}
#Verdict Execution timeMemoryGrader output
Fetching results...