题意:寻找集合中集合能凑成a + b + c = d的最大的d值(每个值只能取一次)
分析:二分的思想,枚举a + b的值,并且保存在数组中,而后排序;再枚举d - c的值并且用二分查找找出相同的a +
b值,并且做判断,是否含有重复的值
总结:题目还可以,不过又因为改错浪费了太多时间,第二天向同学请教时一下子便看到了错误,接受教训,规定好
做题时间,争取将效率提到最高
用两种方法实现判断是否含有同样的值
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
#define MAXN 1005
#define INF 0x3f3f3f3f
int num[MAXN],arr[MAXN * MAXN],n,cnt;
bool check(int a,int b)
{
int *p1 = lower_bound(num,num + n,a);
int *p2 = lower_bound(num,num + n,b);
if(p1 - num == n || p2 - num == n)
return false;
if(*p1 == a && *p2 == b)
return true;
return false;
}
int run()
{
for(int i = n - 1;i >= 0;i--)
{
for(int j = 0;j <= n - 1;j++)if(i != j)
{
int cur = num[i] - num[j];
int *p1 = lower_bound(arr,arr + cnt,cur);
int *p2 = upper_bound(arr,arr + cnt,cur);
if(p1 == p2 && p1 == arr)break;
int dis = p2 - p1;
if(dis)
{
if(check(num[j],cur - num[j]))
dis--;
if(num[j] && check(num[i],-num[j]))
dis--;
if(dis > 0)
return num[i];
}
}
}
return INF;
}
int main()
{
while(scanf("%d",&n),n)
{
for(int i = 0;i < n;i++)
scanf("%d",&num[i]);
sort(num,num + n);
cnt = 0;
for(int i = 0;i < n;i++)
for(int j = i + 1;j < n;j++)
arr[cnt++] = num[i] + num[j];
sort(arr,arr + cnt);
int ans = run();
if(ans != INF)printf("%d\n",ans);
else puts("no solution");
}
}
#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef pair<int,int>pii;
typedef pair<int,pii>node;
#define MAXN 1005
#define INF 0x3f3f3f3f
#define X first
#define Y second
int num[MAXN],n,cnt,dp[MAXN * MAXN];
node arr[MAXN * MAXN];
int run()
{
for(int i = n - 1;i >= 0;i--)
{
for(int j = 0;j <= n - 1;j++)if(i != j)
{
int cur = num[i] - num[j];
int *p1 = lower_bound(dp,dp + cnt,cur);
int *p2 = upper_bound(dp,dp + cnt,cur);
if(p1 == p2 && p1 == dp)break;
for(int k = 0;k < p2 - p1 && k + p1 - dp < cnt;k++)
{
int ind = p1 - dp + k;
if(arr[ind].Y.X != num[i] && arr[ind].Y.Y != num[i] &&
arr[ind].Y.X != num[j] && arr[ind].Y.Y != num[j])
return num[i];
}
}
}
return INF;
}
int main()
{
while(scanf("%d",&n),n)
{
for(int i = 0;i < n;i++)
scanf("%d",&num[i]);
sort(num,num + n);
cnt = 0;
for(int i = 0;i < n;i++)
for(int j = i + 1;j < n;j++)
{
arr[cnt].X = num[i] + num[j];
arr[cnt].Y.X = num[i];
arr[cnt++].Y.Y = num[j];
}
sort(arr,arr + cnt);
for(int i = 0;i < cnt;i++)
dp[i] = arr[i].X;
int ans = run();
if(ans != INF)printf("%d\n",ans);
else puts("no solution");
}
}