1#include <cstdio>2#include <cstring>3#include <algorithm>4 using namespacestd;5 intpoint[303],next[603],v[603],c[603],cnt=0, n,m,k,f[303][303][2];6 BOOLp[303];7 voidInsect (intXintYintZ) {next[cnt]=point[x];p oint[x]=cnt;v[cnt]=y;c[cnt]=z;cnt++;}8 voidDfsintx)9 {Ten inti,j; One for(i=point[x];i!=-1; i=Next[i]) A { - if(l[x]==0) l[x]=v[i],p[v[i]]=1;Else - { thej=L[x]; - while(r[j]!=0) j=R[j]; -R[j]=v[i]; p[v[i]]=1; - } + } -I=L[x]; + while(i!=0) Dfs (i), i=R[i]; A } at void - intMain () - { -memset (point,-1,sizeof(point)); -memset (next,-1,sizeof(next)); -memset (V,0,sizeof(v)); inMemset (c,0,sizeof(c)); -Memset (P,0,sizeof(P)); toscanf"%d%d%d\n",&n,&m,&K); + if(k+m-1>n) {printf ("-1\n");return 0;} - inti,a,b,c; the for(i=1; i<n;++i) * { $scanf"%d%d%d\n",&a,&b,&c);Panax Notoginseng insect (a,b,c); insect (b,a,c); -}p[1]=1; Dfs1); theprintf"%d\n", DP (1K1)); +}
Vijos p1523 Greedy Nine-headed dragon (unfinished)