bzoj1753 [Usaco2005 qua]Who's in the Middle
来源:互联网 发布:分级阅读 知乎 编辑:程序博客网 时间:2024/06/16 04:36
题目
深夜水题第三弹,中位数,sort就行。。
#include<bits/stdc++.h>using namespace std;int n,A[100005];inline char nc(){ static char buf[100000],*p1=buf,*p2=buf; return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;}inline int read(){ int x=0,b=1; char c=nc(); for(;!(c<='9'&&c>='0');c=nc())if(c=='-')b=-1; for(;c<='9'&&c>='0';c=nc())x=x*10+c-'0'; return x*b;}inline void write(int x){ if(x==0)putchar('0'); else { char buf[15]; int len=0; if(x<0)putchar('-'),x=-x; while(x)buf[++len]=x%10+'0',x/=10; for(int i=len;i>=1;i--)putchar(buf[i]); } putchar(' ');}int main(){ freopen("in.txt","r",stdin); n=read(); for(int i=1;i<=n;i++)A[i]=read(); sort(A+1,A+n+1); cout<<A[(n+1)>>1]; return 0;}
睡觉。。。
阅读全文
0 1
- bzoj1753 [Usaco2005 qua]Who's in the Middle
- bzoj1753 [Usaco2005 qua]Who's in the Middle
- 1753: [Usaco2005 qua]Who's in the Middle (快速排序)
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- Who's in the Middle
- vue2.0组件之间的通信
- Java代码发送Http请求
- 41. First Missing Positive
- 经典递归问题回顾——汉诺塔
- 动态创建Lambda表达式实现高级查询
- bzoj1753 [Usaco2005 qua]Who's in the Middle
- input标签相关
- 【题目】八数码难题(BFS)
- Substance Designer 生成高清大尺寸地表混合纹理
- Openmp入门(2)(for + sections)
- OpenGL_9:着色器之uniform变量
- python_lintcode_718重复字串_706二进制时间
- 程序设计入门——Java作业
- 活动的最佳实践