摘要:
枚举跑多少天,动态加边即可。 cpp include include include include using namespace std; const int N=1000005,inf=0x3f3f3f3f; int n,m,K,p[50],z[50],g[50][50],fa[50],ans 阅读全文
摘要:
7月倒数第二天补flag 拆点,像深海机器人问题一样。最后求路线的时候dfs一下,根据流量判定走了几个机器人,不能超过流量即可。 cpp include include include include using namespace std; const int inf=0x3f3f3f3f,N=5 阅读全文