【Luogu3932】浮游大陆的68号岛
problemsolutioncodes//1,2:各在左右:把所有物品从区间移到最左边的花费减去把所有物品从目标位置移到最左边的花费就是把所有物品从区间移到目标位置的花费,右边同理。//3:若目标仓库在区间内部,将区间…
problemsolutioncodes//1,2:各在左右:把所有物品从区间移到最左边的花费减去把所有物品从目标位置移到最左边的花费就是把所有物品从区间移到目标位置的花费,右边同理。//3:若目标仓库在区间内部,将区间…
problemsolutioncodes//f[i]:第i秒最远可以走多远#includeusingnamespacestd;constintmaxn=300010;intm,s,t,f[maxn];intmain(){…
problemsolutioncodes//语文题,这很好lastsubmit#include#includeusingnamespacestd;constintmaxn=3100;intn,m,a[maxn][maxn…
problemsolutioncodes#include#includeusingnamespacestd;intmain(){intn;strings;cin>>s>>n;for(inti=0;i
problemsolutioncodes#includeusingnamespacestd;intn,ans=0,c[10],e[10][10];boolok(intpos){for(inti=0;i
problemsolutioncodes#include#include#includeusingnamespacestd;inta[101],b[101];doublef[101][101];intn,m,x,y,s,…
problemsolutioncodes#includeintp[101],a[101],k,n;longlongans[100001],MIN;intmain(){ans[0]=1;scanf("%d%d",&k,&n…
problemsolutioncodes#includeintn,A[15],isp[50],vis[50],ok=1;boolis_prime(intx){for(inti=2;i
problemsolutioncodes#include#include#includeusingnamespacestd;intn,k;doublea[10000];boolC(doublex){intsum=0;fo…
problemsolutioncodes#include#includeusingnamespacestd;intN,M,ans,n;structnm{intPi;intAi;}U[5050];boolcmp(const…