题目链接:http://lightoj.com/volume_showproblem.php?problem=1307
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, 109].
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 |
Developed and Maintained by
JANE ALAM JAN |
Copyright © 2012
LightOJ, Jane Alam Jan |
题目大意:给出三角形的边的长度,求构成三角形的个数
题目解析:给所有边按从小到大的顺序排序,判断是不是三角形,满足 a[i] + a[j] > a[k] (i < j < k)即可(自己证,,),然后二分 k 的范围,求下和
代码如下:
二分(Time: 412 MS):
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#define N 10009
using namespace std;
const int inf = 1e9;
const int mod = 1<<30;
const double eps = 1e-8;
const double pi = acos(-1.0);
typedef long long LL;
int a[N];
int main()
{
int t, n, cnt = 0, i, j;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
for(i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
int ans = 0, l, r, md, now;
for(i = 1; i <= n; i++)
{
for(j = i + 1; j <= n; j++)
{
l = j; r = n;
while(l <= r)
{
md = (l + r) >> 1;
if(a[i] + a[j] > a[md]) now = md, l = md + 1;
else r = md - 1;
}
ans += now - j;
}
}
printf("Case %d: %d\n", ++cnt, ans);
}
return 0;
}
非二分(Time: 88 MS):
#include<iostream>
#include<algorithm>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<string>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<cmath>
#define N 10009
using namespace std;
const int inf = 1e9;
const int mod = 1<<30;
const double eps = 1e-8;
const double pi = acos(-1.0);
typedef long long LL;
int a[N];
int main()
{
int t, n, cnt = 0, i, j;
scanf("%d", &t);
while(t--)
{
scanf("%d", &n);
for(i = 1; i <= n; i++) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
int ans = 0, k;
for(i = 1; i <= n; i++)
{
k = i;//必须这样写,放第二重循环会LTE
for(j = i + 1; j <= n; j++)
{
while(k <= n && a[i] + a[j] > a[k]) k++;
ans = ans + k - j - 1;
}
}
printf("Case %d: %d\n", ++cnt, ans);
}
return 0;
}