Cod sursa(job #2168116)
Utilizator | Data | 14 martie 2018 09:38:17 | |
---|---|---|---|
Problema | Flux maxim | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <vector>
#include <queue>
#define nmax 1002
using namespace std;
int a[nmax][nmax];
int cost[nmax][nmax];
void dfs(int nod)
{
if(nod==1)
mini=10000000;
for(int i=1;i<=n;i++)
{
if(a[nod][i])
{
mini=min(mini,c[nod][i]);
dfs(i);
}
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y>>cost;
a[x][y]=1;
c[x][y]=cost;
}
return 0;
}