LIGHT OJ 1307 - Counting Triangles【二分枚举】

1307 - Counting Triangles

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

You are given N sticks having distinct lengths; you have to form some triangles using the sticks. A triangle is valid if its area is positive. Your task is to find the number of ways you can form a valid triangle using the sticks.

Input

Input starts with an integer T (≤ 10), denoting the number of test cases.

Each case starts with a line containing an integer N (3 ≤ N ≤ 2000). The next line contains N integers denoting the lengths of the sticks. You can assume that the lengths are distinct and each length lies in the range [1, 10⁹].

Output

For each case, print the case number and the total number of ways a valid triangle can be formed.

Sample Input	Output for Sample Input
3 5 3 12 5 4 9 6 1 2 3 4 5 6 4 100 211 212 121	Case 1: 3 Case 2: 7 Case 3: 4

题意：给你n块砖头，砖头按长度升序给出，问你能从中选三块砖头能组成三角形的组合有多少种；

思路：最大2000，不能用N^3，只能用N^2lgN的，N^2好说枚举两条边，剩下的边怎样才能lgN，lgN的只学过二分，注意到是有序给出的（无序时排一下序）就可以二分查找另一条边了，我是反过来求的找不符合的三角形有多少，然后从总数中减去就是答案，直接找也行买没什么大差别；

AC代码：

#include<cstdio>
#include<algorithm>
using namespace std;

typedef long long LL;

LL a[2222];

int main()
{
	LL T,i,s,N,p,sum,j,Kase=0;
    scanf("%lld",&T);
	while(T--)
	{
		scanf("%lld",&N);
		for(i=1;i<=N;++i) scanf("%lld",&a[i]);
		sort(a+1,a+N+1);
		sum=0;
		for(i=1;i<=N-2;++i)
		{
			for(j=i+1;j<=N-1;++j)
			{
				s=a[i]+a[j];
				p=lower_bound(a+j+1,a+N+1,s)-a;
				if(p!=N+1)
				{
					sum+=(N-p+1);
				}
				else break;//优化时间 一个找到了结尾 下面的就不用枚举了 肯定找到结尾
			}
		}
		sum=N*(N-1)*(N-2)/6-sum;
		printf("Case %lld: %lld\n",++Kase,sum);
	}	
	return 0;
}