Magic Triangle

最新推荐文章于 2019-07-22 16:34:37 发布

冬天的一缕阳光

最新推荐文章于 2019-07-22 16:34:37 发布

阅读量565

点赞数

分类专栏： DP练习文章标签： You have N sticks Magic Triangle

本文链接：https://blog.csdn.net/tangsl388/article/details/26358891

版权

DP练习专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Description

You have N sticks on your hands. When I show you a stick, you should tell me how many pairs of sticks on your hands can make a triangle with my stick.

Input

The first line is a positive integer T standing for the numbers of test cases. The first line of each test case is two positive integers N, M, standing for the number of sticks on your hands and the times I will show you a stick. The second line has N positive integers. Each stands for i-th length of a stick on your hands. The i-th stick's length is li. Then M lines follow .Each is a positive integer Ki indicating the length of stick that I show you.(1<=T<=100,2<=N<=2000,1<=M<=100000,1<=li<=50000,1<=ki<=100000)

Output

For each stick I show you, output the number of pair that can make a triangle with this stick. Each output should be in one line.

Sample Input

Sample Output

3
0
3

题目意思：

本题就给n个点，放在一个数组a里面。然后给一个数，问从a里面取出两个数能否构成一个三角形，能组成三角形的个数。

本题暴力肯定是不行的，时间复杂度太高。本题的复杂度最大O（n*n）+O（m）；而本题我用的预处理此处的复杂度为n*n，然后输入m个数就是o（1）了。这题在比赛的时候始终不知道怎么做。

最后采取一个里散化点的范围然后就一个查找。代码比较简单，也很容易理解。只要知道区间离散化就好。

代码：

#include<iostream>
#include<fstream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<stack>
#include<string>
#include<vector>
#include<sstream>
#include<cassert>
using namespace std;
//#define LL __int64

#ifdef __int64
typedef __int64 LL;
#else
typedef long long LL;
#endif

int Abs(int t){
  if(t<0) return 0-t;
  return t;
}
int a[2005];
int b[50000*2+2];
int sum[50000*2+2];
int main() {
    int t;
    cin>>t;

    while(t--) {
        int n,m;
        scanf("%d%d",&n,&m);
        for(int i=0; i<n; i++) {
            scanf("%d",&a[i]);
        }

        memset(b,0,sizeof(b));
        for(int i=0; i<n; i++) {
            for(int j=i+1; j<n; j++) {
                int mi=Abs(a[i]-a[j]);
                int ma=a[i]+a[j];
                b[mi+1]++;
                b[ma]--;
            }
        }

        // for(int i=0;i<n;i++){
        //   cout<<b[i]<<endl;
        // }

        sum[0]=b[0];
        for(int i=1; i<50000*2+2; i++) {
            sum[i]=sum[i-1]+b[i];
        }

        int x;
        for(int i=0; i<m; i++) {
            scanf("%d",&x);
            printf("%d\n",sum[x]);
        }
    }
    return 0;
}