带负下标背包18分求助!
查看原帖
带负下标背包18分求助!
494192
ChickenDrinkingMilk楼主2023/10/20 19:50
#include<iostream>
#include<cstring>
#include<cmath>
#include<cstring>
#include<bits/stdc++.h>
using namespace std;
const int N=1000,MAX=6000;
int n,a[N+5],b[N+5],dp[2][12*N+5],sum;
int main(){
    //freopen("P1282_2.in","r",stdin);
    //freopen("probem2.out","w",stdout);
    ios::sync_with_stdio(0);
    /*CSP RP++*/
    cin>>n;
    for (int i=1;i<=n;i++) cin>>a[i];
    for (int i=1;i<=n;i++) cin>>b[i];
    for (int i=-5000;i<=5000;i++) dp[0][i+MAX]=1e9;
    dp[0][MAX]=0;
    for (int i=1;i<=n;i++){
        //cerr<<i<<'\n';
        for (int j=-5000;j<=5000;j++) dp[i&1][j+MAX]=1e9;
        for (int j=5000;j>=-5000;j--)
            //dp[i&1][j+MAX]=min(dp[!(i&1)][j-(a[i]-b[i])+MAX],dp[!(i&1)][j-(b[i]-a[i])+MAX]+1);
        //for (int j=-20;j<=20;j++) cerr<<i<<' '<<j<<' '<<dp[i&1][j+MAX]<<'\n';
    }
    //cerr<<"A\n";
    for (int i=0;i<=5000;i++){
        if (min(dp[n&1][i+MAX],dp[n&1][MAX-i])<1e9){
            cout<<min(dp[n&1][i+MAX],dp[n&1][MAX-i]);
            break;
        }
    }
    return 0;
}

2023/10/20 19:50
加载中...