HDU - 5920 Ugly Problem 求解第一个小于n的回文数

http://acm.hdu.edu.cn/showproblem.php?pid=5920

http://www.cnblogs.com/xudong-bupt/p/4015226.html

把前半部分复制过去，如果太大，那么早到第一个会使得其太大的点，减1，然后对应的中间的变成9

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <string>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cstdlib>
#include <ctime>
#define X first
#define Y second
#define clr(u,v); memset(u,v,sizeof(u));
#define in() freopen("3.h","r",stdin);
#define out() freopen("ans","w",stdout);
#define Clear(Q); while (!Q.empty()) Q.pop();
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e17;
const int inf = 0x3f3f3f3f;
const int maxn = 1e3 + ;
char nxt[maxn], str[maxn];
bool is(char str[], int lenstr) {
    int i = , j = lenstr;
    while (i < j) {
        if (str[i] != str[j]) return false;
        ++i;
        --j;
    }
    return true;
}
void bigCut(char str[], char sub[], char str3[]) {
    int lenstr = strlen(str + ), lensub = strlen(sub + );
//    printf("%d\n", lenstr);
    for (int i = ; i <= lenstr; ++i) str[i] -= '';
    for (int i = ; i <= lensub; ++i) sub[i] -= '';
    int use = lenstr;
    for (int i = lensub; i >= ; --i, --use) {
        if (str[use] < sub[i]) {
            str[use] =  + str[use] - sub[i];
            int p = use - ;
            while (p >=  && !str[p]) {
                str[p] = ;
                p--;
            }
            str[p]--;
        } else str[use] -= sub[i];
    }
    for (int i = ; i <= lenstr; ++i) str[i] += '';
    int to = ;
    int p = ;
    while (p < lenstr && str[p] == '') p++;
    while (p <= lenstr) {
        str3[++to] = str[p++];
    }
    str3[++to] = '\0';
}
char s2[];
void findNxt(char str[], int lenstr) {
    if (is(str, lenstr)) {
        strcpy(nxt + , str + );
        return;
    }
    if (str[] == '') {
        bool flag = true;
        for (int i = ; i <= lenstr; ++i) {
            if (str[i] != '') {
                flag = false;
                break;
            }
        }
        if (flag) {
            for (int i = ; i <= lenstr - ; ++i) nxt[i] = '';
            nxt[lenstr] = '\0';
            return;
        }
    }
    for (int i = ,j=lenstr; i <=j; ++i,--j) {
        s2[j] = s2[i] = str[i];
    }
    for (int i = lenstr /  + ; i <= lenstr; ++i) {
        if (str[i] < s2[i]) {
            for(int j=(lenstr+)/;;j--)
            {
                if(s2[j]=='')
                {
                    s2[j]='';
                    s2[lenstr-j+]=s2[j];
                }
                else
                {
                    s2[j]--;
                    s2[lenstr-j+]=s2[j];
                    break;
                }
            }
            break;
        }
    }
    for (int i = ; i <= lenstr; ++i) nxt[i] = s2[i];
    nxt[lenstr + ] = '\0';
}

char res[];
char sub[] = "";
vector<string> vc;
int f;
void work() {
    printf("Case #%d:\n", ++f);
    vc.clear();
    scanf("%s", str + );
    int lenstr = strlen(str + );
//    findNxt(str, lenstr);
//    printf("%s\n", nxt + 1);
    while (true) {
        findNxt(str, lenstr);
        if (strcmp(str + , nxt + ) == ) {
            if (is(str, lenstr)) {
                vc.push_back(str + );
                break;
            } else {
                vc.push_back("");
                sub[] = '';
                sub[] = '';
                sub[] = '\0';
                bigCut(str, sub, res);
                strcpy(str + , res + );
                lenstr = strlen(str + );
                continue;
            }
        }
        vc.push_back(nxt + );
        bigCut(str, nxt, res);
        strcpy(str + , res + );
        lenstr = strlen(str + );
    }
    printf("%d\n", vc.size());
    for (int i = ; i < vc.size(); ++i) {
        printf("%s\n", vc[i].c_str());
    }
}

int main()
{
    #ifdef LOCAL
    in();
    #else
    #endif
    int t;
    scanf("%d", &t);
    while (t--) work();
    return ;
}

贪心的思路是：最好不要更改前半部分，权值大。