hdu 2578 Dating with girls(1)(二分查找)
来源:互联网 发布:今天网络为什么不能用 编辑:程序博客网 时间:2024/06/01 08:52
做了Dating with girls(2),强迫症犯了,所以一定要把这道题也做了。
排序,删除重复元素,然后二分查找一遍。水题。
#include<stdio.h>#include<string.h>#include<stdlib.h>#define N 1000005int a[N],n,k;int cmp(const void *a,const void *b){ return *(int *)a-*(int *)b;}int Find(int x){ int l,r; l=1;r=n; while(l<=r) { int mid=(l+r)/2; if(a[mid]<x) l=mid+1; else if(a[mid]>x) r=mid-1; else return 1; } return 0;}int main(){ int T; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&k); for(int i=1;i<=n;i++) scanf("%d",&a[i]); qsort(a+1,n,sizeof(a[0]),cmp); int j=1; a[j++]=a[1]; for(int i=2;i<=n;i++) if(a[i]!=a[i-1]) a[j++]=a[i]; n=j-1; int ans=0; for(int i=1;i<=n;i++) { int temp; if(a[i]*2==k) { ans++; continue; } temp=k-a[i]; if(Find(temp)) ans++; } printf("%d\n",ans); } return 0;}
- hdu 2578 Dating with girls(1)(二分查找)
- hdu 2578 Dating with girls(1)(二分查找)
- hdu 2578 Dating with girls(1) 排序+二分查找 水题
- hdu 2578 Dating with girls(1) (二分)
- Dating with girls(1)(二分)
- HDU2578 Dating with girls(1)(二分)
- hdoj 2578 Dating with girls(1)(二分+队列)
- hdu (2578) Dating with girls(1)
- HDU 2578 Dating with girls(1)
- HDU 2578Dating with girls(1)
- HDU 2578 Dating with girls(1).
- HDU 2578 Dating with girls(1)
- HDU 2578 - Dating with girls(1)
- HDU 2578 Dating with girls(1)
- HDU 2578 Dating with girls(1
- HDU 2578 Dating with girls(1)
- hdu 2578 Dating with girls(1)
- HDU 2578 Dating with girls(1)
- 如何来分析oracle 11g grid infrastructure root.sh 执行错误诊断?
- MySQL中varchar与char区别
- foreach制作表格
- [LeetCode] Maximal Rectangle
- linux内核入门之kfifo介绍(1)
- hdu 2578 Dating with girls(1)(二分查找)
- 数据库查询
- Windows8.1 .NET Framework 3.5 离线安装
- 【摘录】需要增强的技术基础
- java的学习需要积累!
- ACM——Tutor(水题一枚)
- 图论 邻接表 二分图判定 最短路问题
- ubuntu中update-rc.d使用
- hadoop学习笔记一之ubuntu下安装jdk