题面:
代码:
candy:
数学方法,时间复杂度为常数,100 p t s pts pts
代码:
#include<bits/stdc++.h>
using namespace std;
int n,l,r;
int main(){
freopen("candy.in","r",stdin);
freopen("candy.out","w",stdout);
scanf("%d%d%d",&n,&l,&r);
int k=l/n;
int n0=n;
n=n*k;
if(r-n>=n0)printf("%d",n0-1);
else printf("%d",r-n);
return 0;
}
sort:
绞尽脑汁为正解,结果不知哪里WA了,只有8 p t s pts pts,不要太贪。
代码:
#include<bits/stdc++.h>
using namespace std;
int n,q;
struct p{
int id,num;
}a[8030];
int pl[8030],fpl[8030];
int opt,x,v;
bool cmp(p c,p b){
if(c.num!=b.num)
return c.num<b.num;
else
return c.id<b.id;
}
void insertion_sort(int v){
while(!cmp(a[v],a[v