Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <stdio.h>
- #include <string>
- using namespace std;
- int g[1510][1510];
- int d[1510][1510];
- int main()
- {
- int n,i,j;
- cin>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- scanf("%d",&g[i][j]);
- if(n==2)
- {
- cout<<g[1][2];
- return 0;
- }
- d[2][1]=g[1][2];
- int mx,k;
- for(i=3;i<=n;i++)
- {
- d[i][i-1]=1000000000;
- for(j=1;j<i-1;j++)
- {
- d[i][j]=d[i-1][j]+g[i][i-1];
- d[i][i-1]=min(d[i][i-1],d[i-1][j]+g[i][j]);
- }
- }
- mx=1000000000;
- for(i=1;i<n;i++)
- mx=min(mx,d[n][i]);
- cout<<mx;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement