摘要： 关于有源上下界最大流: https://blog.csdn.net/regina8023/article/details/45815023 阅读全文

摘要： #include using namespace std; const int maxN = 107; const int inf = 1e9 + 7; char G[maxN][maxN], snake[maxN][maxN]; int times[maxN][maxN][15]; int n, m, sx, sy, ex, ey, ans; int dir[4][2] = {{0,1},{1... 阅读全文