-
Notifications
You must be signed in to change notification settings - Fork 1
/
10605_PUTNIK.cpp
72 lines (65 loc) · 1.63 KB
/
10605_PUTNIK.cpp
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
// Problem#: 10605
// Submission#: 2776433
// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License
// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/
// All Copyright reserved by Informatic Lab of Sun Yat-sen University
#include <iostream>
#include <cstdio>
using namespace std;
int dp[1510][1510];
int matrix[1510][1510];
int vis[1510][1510];
int dps(int i,int j) {
//cout << i << " " << j << endl;
if(i < j){
swap(i,j);
}
if(vis[i][j]) {
return dp[i][j];
}
else {
vis[i][j] = 1;
if(i == j) {
dp[i][j] = 0;
}
else if(i == j + 1) {
bool first = 0;
for(int k = 0;k < j;k ++) {
if(first ++) {
dp[i][j] = min(dp[i][j],dps(j,k) + matrix[k][i]);
}
else {
dp[i][j] = dps(j,k) + matrix[k][i];
}
}
}
else {
dp[i][j] = dps(i - 1,j) + matrix[i - 1][i];
}
return dp[i][j];
}
}
int main() {
int N;
scanf("%d",&N);
for(int i = 0;i < N;i ++){
for(int j = 0;j < N;j ++){
scanf("%d",&matrix[i][j]);
}
}
vis[1][0] = 1;
dp[1][0] = matrix[1][0];
for(int i = 0;i < N - 1;i ++) {
dps(i+ 1,i);
}
for(int i = 0;i < N;i ++) {
for(int j = 0;j < i;j ++) {
dps(i,j);
}
}
int minf = dps(N - 1,0);
for(int i = 0;i < N - 1;i ++){
minf = min(minf,dps(N-1,i));
}
printf("%d\n",minf);
}