【codevs3143】二叉树的序遍历
problemsolutioncodes#includeusingnamespacestd;constintmaxn=110;inttree[maxn][2];voiddfs1(intnow){cout
problemsolutioncodes#includeusingnamespacestd;constintmaxn=110;inttree[maxn][2];voiddfs1(intnow){cout
problemsolutioncodes#include#includeusingnamespacestd;constintmaxn=110;inttree[maxn][2],higt,weigt[maxn],ww;vo…
problemsolutioncodes/*作者:gwj1139177410题目:p2627村村通*///Kruskal#include#include#includeusingnamespacestd;intn,a[1…
problemsolutioncodes#include#includeusingnamespacestd;structxyz{intx,y;xyz(intx=0,inty=0):x(x),y(y){};};intm,n…
problemsolutioncodes//dp[i+1][j]:从0到i+1这个物品中选出总重量不超过j的物品时总价值的最大值#include#includeusingnamespacestd;intn,s,w[505…
problemsolutioncodes#include#include#include#includeusingnamespacestd;structBigint{vectors;intis_minus;Bigint(…
problemsolutioncodes#include#definemod6662333usingnamespacestd;typedeflonglongLL;LLdfs(LLa,LLb,LLp){if(b==1)re…
problemsolutioncodes//巧妙的利用了x-=min(x,t);x若剩余为0则下面升温也为0#include#includeusingnamespacestd;typedeflonglongLL;intm…
problemsolutioncodes#includeintn,a[(int)1e5+10];intreadint(){intop=1,x=0;charch=getchar();while(ch'9'){if(ch==…
problemsolutioncodes//树形DP//f[u]:割掉u和u子树中所有的叶子节点所需要的最小代价#include#includeusingnamespacestd;typedeflonglongLL;co…