hdu_2141_Can you find it?(二分)
来源:互联网 发布:淘宝刚开业怎么宣传语 编辑:程序博客网 时间:2024/06/05 04:14
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=2141
题意:叫你找三个数,使得这三个数的值为X,如果找得到就输出YES否则输出NO,注意两个32位数相加会爆int
#include<cstdio>#include<algorithm>using namespace std;#define FFC(i,a,b) for(int i=a;i<=b;i++)int L,N,M,t,ic=1,x,l,r,mid,cnt;long long a[510],b[510],c[510],tmp[250010];int lowb(long long *a,int x,int len){for(l=1,r=len;l<=r;)if(a[mid=l+((r-l)>>1)]>=x)r=mid-1;else l=mid+1;return l;}int main(){while(~scanf("%d%d%d",&L,&N,&M)){printf("Case %d:\n",ic++);FFC(i,1,L)scanf("%lld",&a[i]);FFC(i,1,N)scanf("%lld",&b[i]);FFC(i,1,M)scanf("%lld",&c[i]);cnt=0;FFC(i,1,L)FFC(j,1,N)tmp[++cnt]=a[i]+b[j];sort(tmp+1,tmp+1+cnt);sort(c+1,c+1+M);scanf("%d",&t);while(t--){scanf("%d",&x);if(x<c[1]){puts("NO");continue;}int fg=0;FFC(i,1,M)if(tmp[lowb(tmp,x-c[i],cnt)]==x-c[i]){fg=1;break;}if(fg)puts("YES");else puts("NO");}}return 0;}
0 0
- hdu_2141_Can you find it?(二分)
- HDU_2141_Can you find it?
- Can you find it?---二分
- hduCan you find it?二分
- Can you find it?(二分)
- Can you find it? 【二分】
- Can you find it? 二分
- Can you find it? hdu2141 二分查找
- hdu2141Can you find it?(二分查找)
- HDU2141:Can you find it?(二分)
- hdu 2141 Can you find it? 二分
- HDU 2141 Can you find it?(二分)
- hdu 2141 Can you find it? 二分
- 二分 hdu2141 Can you find it?
- HDOJ2141Can you find it?【二分查找】
- HDU 2141 Can you find it?【二分】
- hdu2141 Can you find it?(二分*)
- hdoj2141 Can you find it?二分+模拟
- C#发送Web请求(GET/POST)
- 百度之星2015 资格赛 IP聚合【水坑】
- 大用户并发系统API设计心得
- 多总结
- graphic2D和bufferedImage区别
- hdu_2141_Can you find it?(二分)
- Oracle EBS R12客户模型表结构
- C++作业-5
- 几道关于cocos2dx的面试题
- Wormholes
- leetcode_328 Odd Even Linked List
- floor(x)的使用,及其精度的扩充
- 前言
- 第五届山东省ACM Colorful Cupcakes(Dp)