【codevs3410】别墅房间
problemsolutioncodes#include#includeusingnamespacestd;structxyz{intx,y;xyz(intx=0,inty=0):x(x),y(y){};};intn,m…
problemsolutioncodes#include#includeusingnamespacestd;structxyz{intx,y;xyz(intx=0,inty=0):x(x),y(y){};};intn,m…
problemsolutioncodes#include#includeusingnamespacestd;intn,m,a[1010][1010],book[1010][1010],x,y,ans;constintdx…
problem给你一个长为n的序列求一个长不超过m的连续子段,使子段和最大solution如果n>m;for(inti=1;i>a[i];s[i]=s[i-1]+a[i];}intl=1,r=1;q[l]=0;//sav…
problem给定n个点,m条边的有向图求源点s到汇点的最大流solution最大流模板,,不会看笔记吧。。。codes#include#include#include#includeusingnamespacestd;…
problem给出n个正整数,然后有m个询问询问该整数是否在n个正整数中出现过solution哈希表?当然是set水洛codes#include#includeusingnamespacestd;sets;intmain…
problemsolutioncodes#includeusingnamespacestd;constintmaxn=100010;#definelchp>m;for(inti=1;i>op;if(op==1){cin>…
problemsolutioncodes#includeusingnamespacestd;constintmaxn=100010;#definelchpm;for(inti=1;i>op>>x>>y;if(op==1)…
problemsolutioncodes//不好玩#includeusingnamespacestd;intn,m,a[30010],r,p;intmain(){cin>>n>>m;for(inti=1;i1){p=(p…
problemsolutioncodes#include#includeusingnamespacestd;structpeo{intw,id;}hum[50010];boolcmp(peoa,peob){returna…
problem给定n个点,m条边的有向图求源点s到汇点的最大流solution最大流模板,,不会看笔记吧。。。codes//Edmonds-Karp#include#include#include#includeusin…