everlasting的博客

#include#include#include#include#include#define ll long longusing namespace std;struct node{ int s,t,len; friend bool operator < (node a,node b){ return a.len>b.len; }}e[20020];int n

#include#include#include#include#include #define ll long long#define inf 10000001 using namespace std; struct node{ int to,num;}edge[11000],edge1[11000]; int n,m;int s,e;int pn=1;

#include#include#include#include#include#define ll long longusing namespace std;struct node{ int to,len; node(int x,int y){to=x,len=y;} friend bool operator < (node a,node b){ return a.

#include#include#include#include#include#include#define inf 233333333using namespace std;int n,m;vectorv[20020];bool vis[20020];int dis[20020];void spfa(int s){ for(int i=1; i<=n; i++

bzoj 1036#include#include#include#include#include#define inf 999999999using namespace std;struct node{ int Max,sum; int l,r;}tree[120020];int n;int w[30030],son[30030],totree[30030],

#include#include#define pr pair#define inf 1000000000using namespace std;using namespace __gnu_pbds;typedef tree,rb_tree_tag,tree_order_statistics_node_update> rbtree;typedef rbtree::iterato

最小费用最大流#include#include#include#include#include#define inf 1000000000#define MAXN 110#define MAXM 1010typedef long long ll;using namespace std; struct node{ int from,to,num,cost;}

#include#define MAXN 30030using namespace std;inline int rd(){ int x=0,y=1;char c=getchar(); while(c'9'){if(c=='-')y=-y;c=getchar();} while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar(); return x*