Pagini recente » Cod sursa (job #1330119) | Cod sursa (job #660419) | Cod sursa (job #165987) | Cod sursa (job #2095576) | Cod sursa (job #593941)
Cod sursa(job #593941)
#include<iostream.h>
#include<fstream.h>
long xx[1000],y,i,a[1000][1000],v[1000],k,c,n,m,z,j,inf=0x3f3f3f3f,x,d=inf;
void afis(long k)
{long i,s=0;
s=a[1][xx[1]];
for(i=3;i<=k;i++)
s=s+a[xx[i-1]][xx[i]];
s=s+a[xx[k]][n];
if(s<d)
d=s;
}
int valid(long k)
{long i;
for(i=1;i<k;i++)
if(xx[i]==xx[k])
return 0;
return 1;}
void back(long z)
{long i;
for(i=1;i<=k;i++)
{xx[z]=v[i];
if(valid(z)==1)
if(z==k)
afis(z);
else
back(z+1);}}
int main()
{ifstream f("ubuntzei.in");
ofstream h("ubuntzei.out");
f>>n>>m;
f>>k;
for(i=1;i<=k;i++)
f>>v[i];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=inf;
for(i=1;i<=m;i++)
{f>>x>>y>>c;
a[x][y]=c;
a[y][x]=c;}
for(z=1;z<=n;z++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(a[i][j]>a[z][j]+a[i][z]&&i!=z&&j!=z)
a[i][j]=a[z][j]+a[i][z];
if(k!=0)
{back(1);
h<<d;}
else
h<<a[1][n];
return 0;}