# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
13294 | gs14004 | Skyline (IZhO11_skyline) | C++14 | 2000 ms | 51152 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |