poj 1093 Formatting Text (DP)

#include <iostream>
using namespace std;

const int MAXN = 10000;
const int MAXM = 81;
const int INF = INT_MAX;
const int BASE_BADNESS = 500;
char word[MAXN][MAXM];
int width, len[MAXN];

//计算badness值
int getBadness(int total_len, int num)
{
      if(num == 1) return BASE_BADNESS;
      int q = (width - total_len) / (num - 1);
      int r = (width - total_len) % (num - 1);
      return r * q * q + (num - 1 - r) * (q - 1) * (q - 1);
}
void print_space(int n)
{
      for(int i = 1; i <= n; i++)
           putchar(' ');
}
int main()
{
   int i;  

    while(scanf("%d", &width) && width) {
        getchar();
        int word_num = 0;//记录单词的个数
        char ch = getchar();
        while(ch != '\n') {
            int cnt = 0;
        //下面表输入一个单词
            while(ch != ' ' && ch != '\n') {
                word[word_num][cnt++] = ch;
                ch = getchar();
            }
            word[word_num][cnt] = '\0';
            len[word_num++] = cnt;//len[word_num]第word_num个单词的长度
            while(ch == ' ')
                ch = getchar();
            if(ch == '\n')
                ch = getchar();
        }         

        //f[i]记录从第i个词到第word_num-1个词的最佳排版的badness，最佳排版中从第i个单词起的p[i]个单词做为第一行
        int f[MAXN], p[MAXN];

        f[word_num] = 0;
        for(i = word_num - 1; i >= 0; i--) {
            int j = 1;
            int total_len = 0;
            int minl = INF;
            while(i + j - 1 < word_num && total_len + len[i + j - 1] + (j - 1) <=width) {
                total_len += len[i + j - 1];//记录已选单词的字母长度（个数）
                int score = getBadness(total_len, j) + f[i + j];
                if(score <= minl) {
                    minl = score;
                    p[i] = j;
                }
                j ++;
            }
            f[i] = minl;
        }
        int k = 0;
        //打印输出结果
        while(k < word_num) {
            if(p[k] == 1) {
                printf("%s\n", word[k]);
                k ++;
                continue;
            }
            int total = 0;
            for(i = k; i < k + p[k]; i++)
                total += len[i];
            int q = (width - total) / (p[k] - 1);
            int r = (width - total) % (p[k] - 1);
            for(i = k; i < k + p[k] - 1; i++) {
                printf("%s", word[i]);
                print_space(q + (i >= k + p[k] - 1 - r));
            }
            printf("%s\n", word[p[k] + k - 1]);
            k += p[k];
         }
         printf("\n");
    }
    return(0);
}