POJ 3663 Costume Party (二分查找)

最新推荐文章于 2021-02-23 18:14:49 发布

原创最新推荐文章于 2021-02-23 18:14:49 发布 · 669 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#POJ #二分思想

POJ 同时被 2 个专栏收录

51 篇文章

订阅专栏

二分思想

11 篇文章

订阅专栏

这篇博客介绍了如何利用二分查找算法解决POJ 3663 Costume Party的问题。内容涉及在万圣节期间，农夫约翰需要将他的奶牛们带到化妆舞会，但只有一个适合长度为S的服装。约翰有N头奶牛，每头奶牛的长度不等。问题在于找出多少对不同的奶牛可以穿上这件服装，条件是它们的长度之和不超过服装的长度S。输入包含N头奶牛的长度，输出是满足条件的奶牛对数，注意奶牛的顺序不影响结果。

Costume Party

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 12297		Accepted: 4891

Description

It's Halloween! Farmer John is taking the cows to a costume party, but unfortunately he only has one costume. The costume fits precisely two cows with a length of S (1 ≤ S ≤ 1,000,000). FJ has N cows (2 ≤ N ≤ 20,000) conveniently numbered 1..N; cow i has length L_i (1 ≤ L_i ≤ 1,000,000). Two cows can fit into the costume if the sum of their lengths is no greater than the length of the costume. FJ wants to know how many pairs of two distinct cows will fit into the costume.

Input

* Line 1: Two space-separated integers: N and S
* Lines 2..N+1: Line i+1 contains a single integer: L_i

Output

* Line 1: A single integer representing the number of pairs of cows FJ can choose. Note that the order of the two cows does not matter.

Sample Input

Sample Output

给一个序列，取两个数之和小于等于K，问这样的组合有多少个。

二分查找。

先将序列排序，然后对于每个数a，二分查找有多少个数b，使a+b<=k，即二分求上限和下限，因为要去重，每次只需要从a后面的数到序列最后二分。

#include <stdio.h>
#include <algorithm>
using namespace std;
typedef __int64 ll;

const int maxn=20000+10;
int a[maxn];


int main()
{
	int n,s,i,j,t;
	ll ans;
	scanf("%d%d",&n,&s);
	for(i=0;i<n;i++)
		scanf("%d",&a[i]);
	sort(a,a+n);
	ans=0;
	for(i=0;i<n;i++){
		t=upper_bound(a+i+1,a+n,s-a[i])-(a+i+1);	//从i+1开始，这样不会有重复的情况
		ans+=t;
	}
	printf("%I64d\n",ans);
	return 0;
}