hdu 4277 USACO ORZ

最新推荐文章于 2020-05-10 22:43:17 发布

小纪萱苏

最新推荐文章于 2020-05-10 22:43:17 发布

阅读量233

点赞数

分类专栏： hdu dfs

本文链接：https://blog.csdn.net/xiaojixuansu/article/details/51954681

版权

hdu 同时被 2 个专栏收录

48 篇文章 0 订阅

订阅专栏

dfs

1 篇文章 0 订阅

订阅专栏

迎参加2016多校联合训练的同学们~

USACO ORZ

Time Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4499 Accepted Submission(s): 1486

Problem Description

Like everyone, cows enjoy variety. Their current fancy is new shapes for pastures. The old rectangular shapes are out of favor; new geometries are the favorite.
I. M. Hei, the lead cow pasture architect, is in charge of creating a triangular pasture surrounded by nice white fence rails. She is supplied with N fence segments and must arrange them into a triangular pasture. Ms. Hei must use all the rails to create three sides of non-zero length. Calculating the number of different kinds of pastures, she can build that enclosed with all fence segments.
Two pastures look different if at least one side of both pastures has different lengths, and each pasture should not be degeneration.

Input

The first line is an integer T(T<=15) indicating the number of test cases.
The first line of each test case contains an integer N. (1 <= N <= 15)
The next line contains N integers li indicating the length of each fence segment. (1 <= li <= 10000)

Output

For each test case, output one integer indicating the number of different pastures.

Sample Input

Sample Output

Source

2012 ACM/ICPC Asia Regional Changchun Online

题意：某人需要用所有的栅栏围成一个三角形，计算最多可以围成多少种不同（至少一条边不同）的三角形？

分析：用set构造唯一值判重，注意要用到所有的木棒，构成三角形

#include <iostream>
#include<cstdio>
#include<cstring>
#include<set>
#include<algorithm>
using namespace std;
set<long long>temp;
 int t,n,s[20],sum;
void dfs(int a,int b,int c,int num)
{
    if(num==n)
    {
        if(c>a||c>b||b>a) return;
        if(c&&b&&a&&c+b>a)
        {
            long long tmp=a*sum*sum+b*sum+c;
            temp.insert(tmp);
        }
        return;
    }
    dfs(a+s[num],b,c,num+1);
    dfs(a,b+s[num],c,num+1);
    dfs(a,b,c+s[num],num+1);
}
int main()
{
   scanf("%d",&t);
   while(t--)
   {
       sum=0;
       scanf("%d",&n);
       for(int i=0;i<n;i++)
        {
            scanf("%d",&s[i]);
            sum+=s[i];
        }
       if(n<3)
       {
           printf("0\n");continue;
       }
       temp.clear();
       dfs(0,0,0,0);
//       set<long long>::iterator it;
//       for(it=temp.begin();it!=temp.end();it++)
//        cout<<*it <<endl;
       printf("%d\n",temp.size());
   }
    return 0;
}