Uva--165（暴力）

2014-07-16 16:12:32

题意&思路：搜索递推逐个推下一个数，范围（前个数+1,前面数所能构成的n+1）。具体思路：http://blog.csdn.net/shuangde800/article/details/7755452 这篇博文提供了暴力和动规两种思路～！

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

int h,k,v[10],re[10],n[10],used[1000],tmax;

void Find(int cur,int sum,int num){
    used[sum] = 1;
    if(num >= h)
        return;
    for(int i = 0; i <= cur; ++i){
        Find(cur,sum + v[i],num + 1);
    }
}

void Search(int pos){
    if(pos >= k){
        if(n[k - 1] > tmax){
            tmax = n[k - 1];
            memcpy(re,v,sizeof(v));
        }
        return;
    }
    for(int i = v[pos - 1] + 1; i <= n[pos - 1] + 1; ++i){
        memset(used,0,sizeof(used));
        v[pos] = i;
        Find(pos,0,0);
        int cnt = 0;
        while(used[++cnt]);
        --cnt;
        n[pos] = cnt;
        Search(pos + 1);
    }
}

int main(){
    while(scanf("%d %d",&h,&k) == 2){
        if(!h && !k)
            break;
        memset(v,0,sizeof(v));
        memset(n,0,sizeof(n));
        tmax = -1;
        v[0] = 1;
        n[0] = h;
        Search(1);

        for(int i = 0; i < k; ++i){
            printf("%3d",re[i]);
        }
        printf(" ->%3d\n",tmax);
    }
    return 0;
}