真心给byvoid和gyh神犇跪了,神建模,我开始想的时DP,sb....
题目:
题解:
蒟蒻的代码:
#include#include using namespace std;const int INF=214748364;struct eg{ int u,v,c,w,pr;}x[500011]={};int n,m,need[1011]={},bia[1011]={},num=0,s=0,t;void add(int l,int r,int ci,int wi){ //cout< <<" "< <<" "< <<" "< <<"**"< 0&&d[l]+x[i].w 0) add(s,i,a,0); if (a<0) add(i,t,-a,0); } i=0; while (spfa()) i++; printf("%d",he); system("pause"); return 0;}