51nod 1090 3个数和为0
暴力+二分
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
#define LL long long
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define E 2.71828
#define MOD 1000000007
#define N 1010
int a[N];
int bSearch(int begin, int end, int e)
{
int mid,l = begin,r = end;
while(l <= r)
{
mid = (l + r) >> 1;
if(a[mid] >= e)
r = mid-1;
else
l = mid+1;
}
if(a[l] == e)
return 1;
else
return 0;
}
int main()
{
int n;
scanf("%d",&n);
for(int i =0; i < n; i++)
scanf("%d",&a[i]);
sort(a,a+n);
int flag = 0;
for(int i = 0; i < n; i++)
{
for(int j = i+1; j < n; j++)
{
int x = 0-a[i]-a[j];
if(bSearch(j+1,n-1,x))
{
printf("%d %d %d\n",a[i],a[j],x);
flag = 1;
}
}
}
if(flag == 0)
printf("No Solution\n");
return 0;
}