Pagini recente » Cod sursa (job #2977315) | Cod sursa (job #2346715) | Cod sursa (job #886707) | Cod sursa (job #3279732) | Cod sursa (job #655626)
Cod sursa(job #655626)
#include<fstream>
using namespace std;
ifstream in("ubuntzei.in");
ofstream out("ubuntzei.out");
const int INF =0xfffffff;
const int MAX_N=201;
int main()
{long int A[MAX_N][MAX_N], n,m,i,j,k, v[20], orasetrec;
long int c, suma=0;
in>>n>>m;
in>>orasetrec; for(i=1;i<=orasetrec;i++)
in>>v[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i==j) A[i][j]=0;
else
A[i][j]=INF;
for(; m>=1; --m)
{ in>>i>>j>>c;
A[i][j]=c;
A[j][i]=c;
}
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(A[i][j]>A[i][k]+A[k][j])
A[i][j]=A[i][k]+A[k][j];
/*for(i=1;i<=orasetrec-1;i++)
suma+=A[v[i]][v[i+1]];
suma+=A[1][v[1]];
suma+=A[v[orasetrec]][n]; */
out<<A[1][n];
}