HDU-2141 Can you find it? 简单二分
来源:互联网 发布:python安装错误 编辑:程序博客网 时间:2024/05/16 09:48
题目链接
题目大意:给你三个数列A,B,C 在三个数列中个取个数满足a+b+c = x;
#include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<math.h>#include<algorithm>#include<vector>#include<queue>using namespace std;const int maxn = 505;const int inf = 1<<30;typedef __int64 LL;int l,n,m;int a[maxn],b[maxn],c[maxn],d[maxn*maxn];bool bsearch( int x ){int ld = 0,rd = l*n,mid;while( ld < rd ){mid = (ld+rd)>>1;if( x > d[mid] )ld = mid + 1;else if( x < d[mid] )rd = mid;elsereturn true;}return false;}bool fun( int x ){for( int i = 0; i < m; i ++ ){if( bsearch( x - c[i] ) )return true;}return false;}int main(){//freopen("data.txt","r",stdin);int cas = 1,q,x;while( scanf("%d%d%d",&l,&n,&m) != EOF ){for( int i = 0; i < l; i ++ )scanf("%d",&a[i]);for( int i = 0; i < n; i ++ )scanf("%d",&b[i]);for( int i = 0; i < m; i ++ )scanf("%d",&c[i]);for( int i = 0; i < l; i ++ ) //这里要预处理下 不然三个for妥妥的超时for( int j = 0; j < n; j ++ )d[i*n+j] = a[i] + b[j];sort( d,d+l*n );printf("Case %d:\n",cas++);scanf("%d",&q);for( int i = 0; i < q; i ++ ){scanf("%d",&x);if( fun(x) )puts("YES");elseputs("NO");}}return 0;}
0 0
- 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 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? 二分查找 + 数组合并
- hdu 2141——Can you find it(二分查找)
- HDOJ/HDU 2141 Can you find it? 二分搜索优化
- _file__与PHP链接access数据库操作指南
- android中播放gif动画之三
- delphi实现简单window窗口程序
- HEVC中 Truncated Rice binarization (标准文档的9.3.3.2节)
- test4 利用xml中的语句实现字码转换
- HDU-2141 Can you find it? 简单二分
- eclipse调试时鼠标移动到变量上不显示值的问题
- [springframework] - DispatcherServlet and WebApplicationContext
- 轻松编译google chrome浏览器最新稳定版源代码
- ActiveXObject
- 抽象工厂模式
- 《精通Ext JS 》
- 用异或交换两个整数的陷阱
- Android中关于Volley的使用(零)Android中下载编译Volley