poj 1948 Triangular Pastures 二维01背包

Triangular Pastures

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 5788		Accepted: 1854

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 (3 <= N <= 40) fence segments (each of integer length Li (1 <= Li <= 40) and must arrange them into a triangular pasture with the largest grazing area. Ms. Hei must use all the rails to create three sides of non-zero length. 

Help Ms. Hei convince the rest of the herd that plenty of grazing land will be available.Calculate the largest area that may be enclosed with a supplied set of fence segments. 

Input

* Line 1: A single integer N 

* Lines 2..N+1: N lines, each with a single integer representing one fence segment's length. The lengths are not necessarily unique. 

Output

A single line with the integer that is the truncated integer representation of the largest possible enclosed area multiplied by 100. Output -1 if no triangle of positive area may be constructed. 

Sample Input

5
1
1
3
3
4

Sample Output

692

Hint

[which is 100x the area of an equilateral triangle with side length 4] 

Source

USACO 2002 February

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <math.h>
using namespace std;

const int maxn=888;

int dp[maxn][maxn];

int area(int x,int y,int z)
{
    double p=(x+y+z)/2.0;
    return int(sqrt(p*(p-x)*(p-y)*(p-z))*100);
}

int main()
{
    int n;
    int a[44];
    while(cin>>n)
    {
        int i,j,k;
        int sum=0,m=0;
        memset(a,0,sizeof(a));
        memset(dp,0,sizeof(dp));
        for(i=0;i<n;i++)
            {
                scanf("%d",&a[i]);
                sum+=a[i];
            }
        m=sum>>1;
        dp[0][0]=1;
        for(k=0;k<n;k++)
            for(i=m;i>=0;i--)
             for(j=i;j>=0;j--)
        {
            if(dp[i][j])
                dp[i+a[k]][j]=dp[i][j+a[k]]=1;
        }
        int ans=-1;
        for(i=1;i<=m;i++)
            for(j=1;j<=i;j++)
            if(dp[i][j])
            ans=max(ans,area(i,j,sum-i-j));
        cout<<ans<<endl;


    }
    return 0;
}

感觉状压也能解，只要两次01背包出最接近sum/3的，弱弱水平有限。。写不出来，还是我想错了orz，感觉二维01背包耗时又费空间。。