c_cpp RodCutting - 基本

Posted 2021-05-14

#include<bits/stdc++.h>
using namespace std;

// #DynamicProgramming #StandardProblem

// Memoization

int maxProfit(int l, vector<int> val){
    if(l<=0){
        return 0;
    }
    if(val[l]==0){
        return 0;
    }
    int maxP=INT_MIN;
    for(int j=1;j<=l;j++){
        int with=val[j] + maxProfit(l-j, val);
        int without= maxP;
        maxP=max(with,without);
    }
    return maxP;
}

int maxProfitBU(int l, vector<int> val){
    vector<int> dp(l+1);

    dp[0]=0;
    for(int i=1;i<=l;i++){
        if(val[i]==0){
            dp[i]=0;
        }
        dp[i]=INT_MIN;
        for(int j=1;j<=i;j++){
            int with= val[j]+dp[i-j];
            int without = dp[i];
            dp[i]=max( with, without );
        }
    }
    return dp[l];
}


int main(){
    freopen("ip.txt","r",stdin);
    int t;
    cin>>t;
    while(t--){
        int l;
        cin>>l;
        vector<int> val(l+1);
        //prices of cuts 1 to l
        for(int i=1;i<=l;i++){
            cin>>val[i];
        }
        cout<<"Memoization: "<<maxProfit(l,val)<<endl;
        cout<<"BottomUp: "<<maxProfitBU(l,val)<<endl;
    }
}