Submission #97062

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
97062	2019-02-13 16:03:05	Kalam	스카이라인 (IZhO11_skyline)	C++11	100 / 100	287 ms	210232 KiB

skyline

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// KALAM
# include<bits/stdc++.h>
using namespace std;
const int N = 300 + 77 , inf = 1000000077;
int n , a[N] , dp[N][N][N];
int main(){
   memset(dp , 63 , sizeof(dp));
   cin >> n;
   for(int i = 1;i <= n;++ i)
      cin >> a[i];
   for(int i = 0;i <= a[1];++ i)
      dp[1][0][i] = 3 * i;
   for(int id = 2;id <= n;++ id)
      for(int j = 0;j <= a[id];++ j)
         for(int i = 0;i <= a[id - 1];++ i){
            int now = id , prv = id - 1;
            if(j > 0)
               dp[now][i][j] = dp[now][i][j - 1] + 3;
            if(min(i , j) > 0)
               dp[now][i][j] = min(dp[now][i][j] , dp[now][i - 1][j - 1] + 5);
            int t = min(i , j);
            if(t <= a[id - 2])
               dp[now][i][j] = min(dp[now][i][j] , dp[prv][a[id - 2] - t][i - t] + t * 7 + (j - t) * 3);
         }
   cout << dp[n][a[n - 1]][a[n]];
   return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 100 / 100