poj2586 Y2K Accounting Bug

2017-10-6

解答

我用的枚举法,应该用的贪心

代码

#include<iostream>
using namespace std;

const int N = 12;
long long s,d,m=-1;
int z[N+1];

long long res(){
    int i,j;
    for (i=1;i<=8;i++){
        long long cnt=0;
        for (j=1;j<=5;j++){
            if (z[i+j-1]) cnt=cnt+s;
            else cnt=cnt+d;
        }
        if (cnt>0) return -1;
    }
    long long cnt=0;
    for (i=1;i<=N;i++){
        if (z[i]) cnt=cnt+s;
        else cnt=cnt+d;
    }
    return cnt;
}

void dfs(int step){
    if (step==N+1){
        m=max(m,res());
        return ;
    }
    z[step]=1;
    dfs(step+1);
    z[step]=0;
    dfs(step+1);
}

int main(){
    while(cin>>s>>d){
        m=0;
        d=-d;
        dfs(1);
        if (m>0) cout<<m<<endl;
        else cout<<"Deficit"<<endl;
    }
    return 0;
}