Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- const int D=m*n;
- void Tim(int i)
- {
- for (int i=0;i<n;i++)
- for (int j=0;j<m;j++)
- {
- if(kt[i][j]==true)
- {
- kt[i][j]=false;
- X[i]=a[i][j];
- S+=C[X[i-1]][j];
- if (i==n && j==m)
- {
- if (S<Mincost)
- {
- Mincost=S;
- for (int i=0;i<X.size();i++)
- Bestway[i]=X[i];
- }
- }
- else
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement