foj 1877 DP

dp[i][j]表示当只考虑前i个物品时，要准备加入第i+1个物品时，X[i+1]前面的系数为j时的函数最小值。
转移就是dp[i][j] + j * (-Li) --> dp[i+1][j - Li]
 dp[i][j] + j * ( Li) --> dp[i+1][j + Li]

AC代码如下：

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

#define MAX 0x3f3f3f3f

int dp[44][8200];
int num[50], N, sum;

int main(){
    while( scanf( "%d", &N ) != EOF ){
        sum = 0;
        for( int i = 1; i <= N; i++ ){
            scanf( "%d", &num[i] );
            sum += num[i];
        }
        memset( dp, 0x3f, sizeof( dp ) );
        dp[0][4000] = 0;
        for( int i = 1; i <= N; i++ ){
            for( int j = -sum + 4000; j <= sum + 4000; j++ ){
                if( j - num[i] >= -sum + 4000 ){
                    dp[i][j] = min( dp[i-1][j-num[i]] + ( j - num[i] - 4000 ) * num[i], dp[i][j] );
                }
                if( j + num[i] <= sum + 4000 ){
                    dp[i][j] = min( dp[i-1][j+num[i]] + ( j + num[i] - 4000 ) * ( -num[i] ), dp[i][j] );
                }
            }
        }
        int ans = MAX;
        for( int i = -sum + 4000; i <= sum + 4000; i++ ){
            ans = min( ans, dp[N][i] );
        }
        printf( "%.2lf\n", (double)ans );
    }
    return 0;
}