Cod sursa(job #554339)
Utilizator | Data | 14 martie 2011 19:28:01 | |
---|---|---|---|
Problema | Cuplaj maxim in graf bipartit | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
// http://infoarena.ro/problema/cuplaj
#include <fstream>
#include <queue>
using namespace std;
#define maxSize 10002
#define oo 0x3f3f3f3f
int destination,edges;
bool visit[maxSize];
int capacity[maxSize][maxSize];
int currentFlow[maxSize][maxSize];
int main() {
return (0);
}