Vijos1037 搭建双塔(DP)

题意分析

暴力DP + bitset 优化

代码总览

#include
using namespace std;
int n,s;
int h[105];
int main(){
    scanf("%d",&n);
    for(int i = 1;i<=n;++i) scanf("%d",&h[i]),s+=h[i];
    bitset<3000> dp[3000];
    for(int i  = 0;i<=s;++i) dp[i].reset();
    dp[0].set(1);
    for(int i = 1;i<=n;++i)
        for(int j = s;j>=0;--j)
            if(dp[j].any()){
                dp[j+h[i]] = dp[j] | dp[j+h[i]];
                dp[j] = dp[j] | (dp[j] << h[i]);
            }
    int ans = 0;
    for(ans = s;ans>0;ans--)
        if(dp[ans].test(ans+1)) break;
    if(ans) printf("%d\n",ans);
    else printf("Impossible\n");
    return 0 ;
}