Happy Coding

This blog is for my memorandum.

Happy Coding

This blog is for my memorandum

Ford-Fulkerson

AtCoder Beginner Contest 010 D - 浮気予防

problem D: 浮気予防 - AtCoder Beginner Contest 010 | AtCoder how to solve This problem can be reduced to the maximum matching problems. This means that Ford-Fulkerson is among the good way to solve this problem.We have to take care that th…

Network Flow - Maximum Flow

problem Maximum Flow | Aizu Online Judge code #include <iostream> #include <vector> #define INF (1<<15) using namespace std; struct edge{ int to; int cap; int rev_id; }; class FordFulkerson { private: vector<vector<edge> > adj; int v; int e; vector<bool> visited; public: Ford</bool></vector<edge></vector></iostream>…