网站开发任务书模板,做代理,网站后台不更新,网站如何做词A~D签到题#xff0c;E稍微用点脑子?F经典分治题#xff08;lyd蓝书的袭击#xff09;反正分治算就行了复杂度2个log#xff08;用个归并能到1个log#xff09;
A - hello world
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2…A~D签到题E稍微用点脑子?F经典分治题lyd蓝书的袭击反正分治算就行了复杂度2个log用个归并能到1个log
A - hello world
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#includeset
#includemap
#includecmath
#includequeue
#includestring
#includevector
#includecstdio
#includecstring
#includeiostream
#includealgorithm
#includeunordered_map
using namespace std;
typedef long long ll;
typedef pairint,int pii;
int main()
{IO;int T1;//cinT;while(T--){coutifmmp!xpsme\n;}return 0;
}B - 挂科
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#includeset
#includemap
#includecmath
#includequeue
#includestring
#includevector
#includecstdio
#includecstring
#includeiostream
#includealgorithm
#includeunordered_map
using namespace std;
typedef long long ll;
typedef pairint,int pii;
int main()
{IO;int T1;//cinT;while(T--){int n,x,y;cinnxy;coutmin(x,y) max(xy-n,0)\n;}return 0;
}C - ab
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#includeset
#includemap
#includecmath
#includequeue
#includestring
#includevector
#includecstdio
#includecstring
#includeiostream
#includealgorithm
#includeunordered_map
using namespace std;
typedef long long ll;
typedef pairint,int pii;
int main()
{IO;int T1;//cinT;while(T--){int a,b;cinab;couthexab;}return 0;
}D - 数组的和
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#includeset
#includemap
#includecmath
#includequeue
#includestring
#includevector
#includecstdio
#includecstring
#includeiostream
#includealgorithm
#includeunordered_map
using namespace std;
typedef long long ll;
typedef pairint,int pii;
const int N200010;
ll a[N];
ll s[N];
int n,k;
int main()
{IO;int T1;//cinT;while(T--){cinnk;ll res1e18;for(int i1;in;i) {cina[i];s[i]s[i-1]a[i];}for(int i1;in;i){int jik-1;if(jn)resmin(res,s[i-1]s[n]-s[ik-1]);}coutres\n;}return 0;
}E - 异或
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
#pragma GCC optimize(2)
#includeset
#includemap
#includecmath
#includequeue
#includestring
#includevector
#includecstdio
#includecstring
#includeiostream
#includealgorithm
#includeunordered_map
using namespace std;
typedef long long ll;
typedef pairint,int pii;
const int N200010;
ll a[N];
int p[N];
int main()
{IO;int T1;//cinT;while(T--){int n,q;ll now0;cinnq;while(q--){int k,v;cinkv;if(kn) p[k]^v;int cntn/k;if(cnt1) now^v;coutnow\n;}for(int i1;in;i)if(p[i])for(int ji;jn;ji)a[j]^p[i];for(int i1;in;i)couta[i] ;}return 0;
}F - 最近的两个点
#includebits/stdc.husing namespace std;
typedef long long ll;
typedef pairint,int pii;
const int N100010;
int n;
struct node
{double x,y,z;
}p[N],tmp[N];
bool cmpx(node a,node b)
{return a.xb.x;
}
bool cmpy(node a,node b)
{return a.yb.y;
}
double dis(node a,node b)
{double dxa.x-b.x;double dya.y-b.y;double dza.z-b.z;return sqrt(dx*dxdy*dydz*dz);
}
double solve(int l,int r)
{if(lr) return 1e10;int midlr1;double flagp[mid].x;double resmin(solve(l,mid),solve(mid1,r));//sort(pl,pr1,cmpy);// 归并这一步能够少一个loginplace_merge(pl,pmid1,pr1,cmpy); // 归并排序int k0;for(int il;ir;i)if(p[i].xflag-resp[i].xflagres)tmp[k]p[i];// 经证明下面操作复杂度线性for(int i1;ik;i)for(int ji-1;jtmp[i].y-tmp[j].yresabs(tmp[i].z-tmp[j].z)res;j--)resmin(res,dis(tmp[i],tmp[j]));return res;
}
int main()
{cinn;for(int i1;in;i) cinp[i].xp[i].yp[i].z;sort(p1,p1n,cmpx);printf(%.3lf\n,solve(1,n));return 0;
}
