问题描述
第一种做法(暴力搜索)
O(n4)
简单易懂,直接上代码
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX = 101;
int main()
{
int n, m, arr[MAX];
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++)
scanf("%d", &arr[i]);
int f = 0;
for(int a = 0; a < n; a++)
for(int b = 0; b < n; b++)
for(int c = 0; c < n; c++)
for(int d = 0; d < n; d++)
if(arr[a] + arr[b] + arr[c] + arr[d] == m)
f = 1;
if(f == 1)
printf("Yes\n");
else
printf("No\n");
return 0;
}
第二种做法(二分搜索)
O(n3logn)
思路:
用三重循环把a,b,c找出再通过d = m – a – b – c;判断能否在数组中找到d
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX = 101;
int n, m, arr[MAX];
int search_d(int d)
{
int l = 0, r = n;//l是开头,r是结尾
while(r - l >= 1)
{
int i = (l + r) / 2;
if(d == arr[i])
return 1;
else if(arr[i] < d) l = i + 1;
else r = i;
}
return 0;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++)
scanf("%d", &arr[i]);
sort(arr, arr + n);
int f = 0;
for(int a = 0; a < n; a++)
for(int b = 0; b < n; b++)
for(int c = 0; c < n; c++)
if(search_d(m - arr[a] - arr[b] - arr[c]))
f = 1;
if(f == 1)
printf("Yes\n");
else printf("No\n");
return 0;
}
第三种做法
O(n2logn)
思路:
在第二种做法中我们用了三重循环,在第三种做法中我们只需要两个两重循环,也就是说找出a,b,我们在算出 x = m – a – b,看看能不能找到x。问题来了,我们从那里找出x呢?
我们可以先把所有两个数相加的和枚举出来,用到两重循环也就是第二个两重循环!
然后再去查找看有没有x。
#include<cstdio>
#include<algorithm>
using namespace std;
const int MAX = 101;
int n, m, k[MAX];
int kk[MAX * MAX];//用来保存枚举的两个数的和,保证数组开的足够大
int search_x(int x)
{
int l = 0, r = n * n;
while(r - l >= 1)
{
int i = (r + l) / 2;
if(kk[i] == x)
return 1;
else if(kk[i] < x) l = i + 1;
else r = i;
}
return 0;
}
int main()
{
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++)
scanf("%d", &k[i]);
int p = 0;
//枚举两个数的和
for(int c = 0; c < n; c++)
for(int d = 0; d < n; d++)
kk[p++] = k[c] + k[d];
sort(kk, kk + n * n);
int f = 0;
for(int a = 0; a < n; a++)
for(int b = 0; b < n; b++)
if(search_x(m - k[a] - k[b]))
f = 1;
if(f == 1)
printf("Yes\n");
else
printf("No\n");
return 0;
}