【Luogu1508】Likecloud-吃、吃、吃
problemsolutioncodes#include#includeusingnamespacestd;constintmaxn=1010;intm,n,f[maxn][maxn];intmain(){cin>>m>…
problemsolutioncodes#include#includeusingnamespacestd;constintmaxn=1010;intm,n,f[maxn][maxn];intmain(){cin>>m>…
problemsolutioncodes//Kruskal#include#include#includeusingnamespacestd;intn,a[110][110],fa[110],co,ans;structs…
problemsolutioncodes//BFS+记忆化搜索#include#include#include#definemaxn100000usingnamespacestd;intf[maxn],ans;inta,…
problemsolutioncodes//模拟即可#include#includeusingnamespacestd;structnode{intid,ch,score;booloperatorx.score;if(c…
problemsolutioncodes#include#include#includeusingnamespacestd;conststringnum[]={"zero","one","two","three","fo…
problemsolutioncodes#include#includeusingnamespacestd;constintmaxn=110;inta[maxn],b[maxn],c[maxn];boolcmp(intx…
problemsolutioncodes//MeetintheMiddle#include#include#includeusingnamespacestd;intn,mass,ans(666),f[233];mapma…
problemsolutioncodes/*贪心1.找出不互质的数的集合,就是把互斥的数删去.2.那么当有两个互斥的数时,如果删掉前面(小)的,这个数后面的与它互斥的数也会入选,所以删掉后面的更优。3.因为每个数都是不同…
problemsolutioncodes//优先打价值最大的(如果能打的化)#include#includeusingnamespacestd;structd{intt,w;}a[110];boolcmp(da,db){…
problemsolutioncodes#includeusingnamespacestd;intn,ans=0,t;voidf(inta,charb,charc){ans++;if(a==1){if(t)cout