nike0good |Oier&ACMer | 熟能生巧

差分约束…… Program P1716; var n,i,j,minq,maxq:longint; d:array[-1..10000] of longint; w:array[1..30000,1..2] of longint; flag:boolean; function min(a,b:longint):longint; begin if a<b t

1176 加权版  ……还是差分约束 Program P1201; var n,i,j,minq,maxq:longint; d:array[-1..60000] of longint; w:array[1..60000,1..3] of longint; flag:boolean; function min(a,b:longint):longint; begin

差分约束…… Program p2983; var n,m,i,j,p:longint; c:char; flag:boolean; d:array[0..5000] of longint; w:array[1..100100,1..3] of longint; procedure relax(v,u,w:longint); begin if (d[v

这次的拆分约束有明显的起点。 拆分等式 Xb-Xa      Xa-Xb Program P3169; const maxml=10000; maxn=1000; var n,ml,md,i,j:longint; a,b:array[1..maxml,1..3] of longint; d:array[0..maxn] of longint; fl

http://blog.youkuaiyun.com/skywalkert/article/details/51731556#include<bits/stdc++.h> using namespace std; #define For(i,n) for(int i=1;i<=n;i++) #define Fork(i,k,n) for(int i=k;i<=n;i++) #define ForkD(i,k,