HDU 2124 Can you find it?(二分)
来源:互联网 发布:淘宝怎样投诉客服 编辑:程序博客网 时间:2024/05/01 07:17
思路:
直接按照题目描述的话
AC代码:
#include <iostream>#include <cstdio>#include <string>#include <algorithm>#define eps 0.0000000001typedef long long int lli;using namespace std;lli a[550],b[550],c[550];lli ab[300000];lli cnt;int bs(lli n){ int l = 0,r = cnt-1; int mid = (l+r) >> 1; while(l<=r){ mid = (l+r) >> 1; if(ab[mid] == n){ return 1; } else if(n < ab[mid] ){ r = mid - 1; } else{ l = mid + 1; } } return 0;}lli sn;lli temp;int main(){ lli l,n,m; lli cas = 0; while(~scanf("%lld%lld%lld",&l,&n,&m)){ cnt = 0; cas++; for(lli i = 1;i <= l;i++){ scanf("%lld",a+i); } for(lli i = 1;i <= n;i++){ scanf("%lld",b+i); } for(lli i = 1;i <= m;i++){ scanf("%lld",c+i); } for(lli i = 1;i <= l;i++){ for(lli j = 1;j <= n;j++){ ab[cnt++] = a[i]+b[j]; } } sort(ab,ab+cnt); scanf("%lld",&sn); printf("Case %lld:\n",cas); for(int i = 1;i <= sn;i++){ scanf("%lld",&temp); int ans = -1; for(int i = 1;i <= m;i++){ if( bs(temp - c[i]) ){ ans = 1; break; } } if(ans == 1) puts("YES"); else puts("NO"); } }}
1 0
- HDU 2124 Can you find it?(二分)
- hdu 2141 Can you find it? 二分
- HDU 2141 Can you find it?(二分)
- hdu 2141 Can you find it? 二分
- HDU 2141 Can you find it?【二分】
- 【HDU 2141】【二分】 Can you find it?
- HDU 2141 Can you find it? (二分)
- HDU-2141-Can you find it?【二分】
- HDU 2141 Can you find it?二分
- hdu 2141 Can you find it?(二分)
- hdu 2141 Can you find it?(二分)
- Hdu Can you find it?(二分答案)
- hdu 2141 Can you find it?(二分)
- HDU 2141 Can you find it? <二分>
- [ACM] hdu 2141 Can you find it? (二分查找)
- HDU 2141 Can you find it?(二分查找)
- HDU - 2141 Can you find it?(二分查找)
- hdu 2141 Can you find it?(二分查找)
- Apache Avro 序列化与反序列化 (Java 实现)
- Android实现基于试卷知识点的树形控件
- Kafka 生产消费 Avro 序列化数据
- 51nod 1021 石子归并(dp-矩阵连乘)
- 数论专题 T4
- HDU 2124 Can you find it?(二分)
- PHP设计模式(三):封装
- 01字符串
- 如果当时
- MongoDB_Java连接mongo 将结果集分页
- linux c 之 系统编程(文件1)
- React学习之路----1
- RDD & java 类 (反射)构建 DataFrame ---java code
- 离散傅里叶变换