【NOIP2008】【Luogu1058】立体图
problemsolutioncodes#include#includeusingnamespacestd;intm,n,a[1001][1001],ma[1001],maxx,maxy;intz[6]={2,1,0,0…
problemsolutioncodes#include#includeusingnamespacestd;intm,n,a[1001][1001],ma[1001],maxx,maxy;intz[6]={2,1,0,0…
problemsolutioncodes#include#includeusingnamespacestd;intans;intmain(){stringstr;cin>>str;for(inti=0,j=1;i
problem将1,2,3……9这九个数分成3组,分别组成3个三位数。且使这3个三位数构成1:2:3的比例。求出所有满足的方案solution19重循环枚举九个数。不剪枝复杂度(9^9)剪枝后复杂度O(9!)#inclu…
problemsolutioncodes#includeusingnamespacestd;voiddfs(intdep,intn){//if(n
problemsolutioncodes#include#definemaxn1
problemsolutioncodes#include#include#definemaxn10#definemaxvmaxn*30charin[maxn],post[maxn];charlch[maxv],rch[m…
problemsolutioncodes#include#include#definemaxn550usingnamespacestd;inttree[maxn][2];voiddfs(charx){coutn;for(…
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,…