Pagini recente » Cod sursa (job #427577) | Cod sursa (job #413773) | Cod sursa (job #546756) | Cod sursa (job #300572) | Cod sursa (job #559188)
Cod sursa(job #559188)
#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
int n,m,a[5001][5001],a2[5001][5001],viz[5001],v[5001],k;
int rec(int z,int x,int nr)
{
int i;
//cout<<x<<" "<<nr<<'\n';
a2[z][x]=nr;
for(i=1;i<=n;i++)
if(a[x][i] && !viz[i] && a2[z][i]>max(a2[z][x],a[x][i]))
{
viz[i]=1;
rec(z,i,max(a2[z][x],a[x][i]));
viz[i]=0;
}
}
int main()
{
int i,j,xx,yy,cc;
ifstream f("radiatie.in");
ofstream g("radiatie.out");
f>>n>>m>>k;
for(i=1;i<=m;i++)
{
f>>xx>>yy>>cc;
a[xx][yy]=a[yy][xx]=cc;
}
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a2[i][j]=320000;
for(i=1;i<=k;i++)
{
f>>xx>>yy;
if(!v[xx])
{
viz[xx]=1;
rec(xx,xx,0);
viz[xx]=0;
g<<a2[xx][yy]<<'\n';
v[xx]=1;
}
else g<<a2[xx][yy]<<'\n';
}
}