树形dp
Change_ZHONG
成在坚持
展开
-
tjut 4705
#include#include#include#includeusing namespace std;#define MAXN 100100#pragma comment(linker, "/STACK:16777216")struct Edge{ int v,next;}edge[MAXN*4];int NE;long long n;int head[MAXN原创 2016-07-31 17:14:20 · 157 阅读 · 0 评论 -
tjut 4679
#pragma comment(linker, "/STACK:1024000000,1024000000") #include#include#define N 100001int n,head[N],num,vis[N],dp[N][3],dp1[N][2],min,iid;struct edge{ int st,ed,next,w,id;}E[N*2];void a原创 2016-07-30 17:32:29 · 167 阅读 · 0 评论 -
tjut 1561
#include #include #include #include using namespace std; int N,M,v[223]; vectorson[223]; int dp[223][223]; void dfs(int n,int left){ int i,j,k,len=son[n].size(); d原创 2016-07-29 20:52:26 · 138 阅读 · 0 评论 -
tjut 4661
#pragma comment(linker,"/STACK:100000000,100000000") #include #define LL __int64 const int mod = 1000000007; const int maxn = 1000003; struct EDGE{ int to, next; }edge[maxn*2];原创 2016-07-29 20:23:21 · 180 阅读 · 0 评论 -
tjut 4616
#pragma comment(linker,"/STACK:102400000,102400000") #include #include #include #include #include using namespace std; #define ReadFile(str) freopen(str,"r",stdin); #define CLR(c,原创 2016-07-27 17:24:37 · 489 阅读 · 0 评论 -
tjut 3534
#include #include const int N=500000; const int inf=0x3fffffff; int head[N],num,Len[N],ans,node[N],k; struct edge { int ed,w,next; }e[N*2]; void addedge(int x,int y,int w) {原创 2016-08-31 15:55:43 · 168 阅读 · 0 评论 -
tjut 3586
#include#include#includeusing namespace std;const int VM=1010;const int INF=1000010; //开始设为0x3f3f3f3f给了WAstruct Edge{ int to,nxt; int cap;}edge[VM<<1];int n,m,cnt,head[VM];int dp原创 2016-09-12 23:09:55 · 154 阅读 · 0 评论 -
tjut 5927
#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define mst(ss,b) memset((ss),(b),原创 2016-11-03 16:14:16 · 181 阅读 · 0 评论