hdu 5920 贪心+模拟

传送门

题意：输入一个长整数s（s<=10¹⁰⁰⁰），求将其拆分为不超过50个回文串之和的方案。

做法：每次处理左右两边减多少呢答案是左右两边min(左，右，9) 这么多。

注意的点：对于k这个位置，他对应的回文位置j=k-1+len-i+1;长度l=k-1+(len-k+1)/2;&1的情况a[l+1]

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=2e3+10;
const int maxx=4e5+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

char s[maxn];
int a[maxn],b[maxn];
int ans[55][maxn];
void solve()
{
    scanf("%s",s);
    int len=strlen(s),k=1;
    FOr(0,len,i)
        a[i+1]=s[i]-'0';
    int n=0;
    W(k<=len)
    {
        int l=k-1+(len-k+1)/2,pos=0;
        FOR(k,l,i)
        {
            int j=k-1+len-i+1;
            if(a[j]<a[i])
            {
                a[j]+=10;
                a[j-1]--;
                pos=j-1;
            }
        }
        W(a[pos]<0)
        {
            a[pos]+=10;
            a[pos-1]--;
            pos=pos-1;
        }
        if(a[k]==0) k++;
        l=k-1+(len-k+1)/2;
        memcpy(b,a,sizeof(b));
        FOR(k,l,i)
        {
            int j=k-1+len-i+1,t=min(a[i],a[j],9);
            a[i]-=t;
            a[j]-=t;
        }
        if((len-k+1)&1)
            a[l+1]-=min(a[l+1],9);
        int t=1;
        pos=k;
        ans[n][0]=len-pos+1;
        for(;pos<=len;pos++)
        {
           ans[n][t++]=b[pos]-a[pos];
        }
        n++;
        W(a[k]==0) k++;
    }
    print(n);
    for(int i=n-1;i>=0;i--)
    {
        FOR(1,ans[i][0],j)
            printf("%d",ans[i][j]);
        puts("");
    }
}
int main()
{
    //freopen( "in.txt" , "r" , stdin );
    //freopen( "data.txt" , "w" , stdout );
    int t=1;
    s_1(t);
    for(int cas=1;cas<=t;cas++)
    {
        printf("Case #%d:\n",cas);
        solve();
    }
}