poj2176 Folding

$题目传送门poj2176$

---

题目

$Folding$

$Time Limit: 1000MS$
$Memory Limit: 65536K$
$Total Submissions: 1715$
$Accepted: 617$
$Special Judge$

$Description$

Bill is trying to compactly represent sequences of capital alphabetic characters from ‘A’ to ‘Z’ by folding repeating subsequences inside them. For example, one way to represent a sequence AAAAAAAAAABABABCCD is 10(A)2(BA)B2(C)D. He formally defines folded sequences of characters along with the unfolding transformation for them in the following way:
A sequence that contains a single character from ‘A’ to ‘Z’ is considered to be a folded sequence. Unfolding of this sequence produces the same sequence of a single character itself.
If S and Q are folded sequences, then SQ is also a folded sequence. If S unfolds to S’ and Q unfolds to Q’, then SQ unfolds to S’Q’.
If S is a folded sequence, then X(S) is also a folded sequence, where X is a decimal representation of an integer number greater than 1. If S unfolds to S’, then X(S) unfolds to S’ repeated X times.

According to this definition it is easy to unfold any given folded sequence. However, Bill is much more interested in the reverse transformation. He wants to fold the given sequence in such a way that the resulting folded sequence contains the least possible number of characters.

$Input$

The input contains a single line of characters from ‘A’ to ‘Z’ with at least 1 and at most 100 characters.

$Output$

Write to the output a single line that contains the shortest possible folded sequence that unfolds to the sequence that is given in the input file. If there are many such sequences then write any one of them.

$Sample Input$

AAAAAAAAAABABABCCD

$Sample Output$

9(A)3(AB)CCD

---

题解

看样例猜题意：折叠字符串，使长度最短。
这是一道很简单的区间DP。设$f[i][j]$表示折叠后的最短字串，$g[i][j]$表示$f[i][j]$的长度。$f[i][j]$可以直接折叠，也可以合并两段。
由于贪心，我们可以发现：折叠次数越大，长度越短。我们可以枚举折叠次数，直接转移。
所以，这题就简单地被解决了。

---

标程

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

const int N = 150;
char s[N], r[N];
char f[N][N][N];
int g[N][N];

void fun(int a, int b) {
    if (a == b) {
        f[a][b][0] = s[a];
        g[a][b] = 1;
        return;
    }
    for (int i = 1; i <= b - a; i++) {
        if ((b - a + 1) % i) continue;
        bool p = 1;
        for (int j = a + i; j <= b; j++) {
            if (s[j] == s[j - i]) continue;
            p = 0; break;
        }
        if (!p) continue;
        if (!g[a][a + i - 1]) fun(a, a + i - 1);
        sprintf(r, "%d", (b - a + 1) / i);
        strcpy(f[a][b], r);
        g[a][b] = strlen(f[a][b]);
        f[a][b][g[a][b]++] = '(';
        strcat(f[a][b], f[a][a + i - 1]);
        g[a][b] += g[a][a + i - 1];
        f[a][b][g[a][b]++] = ')';
        break;
    }
    for (int i = a; i < b; i++) {
        if (!g[a][i]) fun(a, i);
        if (!g[i + 1][b]) fun(i + 1, b);
        if (!g[a][b] || g[a][i] + g[i + 1][b] < g[a][b]) {
            strcpy(f[a][b], f[a][i]);
            strcat(f[a][b], f[i + 1][b]);
            g[a][b] = g[a][i] + g[i + 1][b];
        }
    }
}

int main() {
    scanf("%s", s);
    int l = strlen(s);
    fun(0, l - 1);
    printf("%s\n", f[0][l - 1]);
    return 0;
}

---