HDU 5938 Four Operations

同样是贪心，a + b - c * d / e。

想办法 把  c * d / e 构造的尽可能小，a + b 构造的尽可能大。先确定/号的位置，分析一下不难发现e要么是1位要么是2位，所以都枚举一下，c和d都只可能是1位，这样的话 * 和 -的位置也确定了，+ 要使得最大，肯定是让a 1位 或者b 1位，剩余的全部给另外一个。把这几种情况都讨论一下，然后比较一下哪个值最大。

【代码】

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <bitset>
using namespace std;

#define rep(i,a,b) for (int i=(a),_ed=(b);i<=_ed;i++)
#define per(i,a,b) for (int i=(b),_ed=(a);i>=_ed;i--)
#define pb push_back
#define mp make_pair
const int inf_int = 2e9;
const long long inf_ll = 2e18;
#define inf_add 0x3f3f3f3f
#define mod 1000000007
#define LL long long
#define ULL unsigned long long
#define MS0(X) memset((X), 0, sizeof((X)))
#define SelfType int
SelfType Gcd(SelfType p,SelfType q){return q==0?p:Gcd(q,p%q);}
SelfType Pow(SelfType p,SelfType q){SelfType ans=1;while(q){if(q&1)ans=ans*p;p=p*p;q>>=1;}return ans;}
#define Sd(X) int (X); scanf("%d", &X)
#define Sdd(X, Y) int X, Y; scanf("%d%d", &X, &Y)
#define Sddd(X, Y, Z) int X, Y, Z; scanf("%d%d%d", &X, &Y, &Z)
#define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin())
#define all(a) a.begin(), a.end()
#define   mem(x,v)      memset(x,v,sizeof(x))
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<long long> vll;
inline int read(){int ra,fh;char rx;rx=getchar(),ra=0,fh=1;while((rx<'0'||rx>'9')&&rx!='-')rx=getchar();if(rx=='-')fh=-1,rx=getchar();while(rx>='0'&&rx<='9')ra*=10,ra+=rx-48,rx=getchar();return ra*fh;}


char s[25];



int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    //ios::sync_with_stdio(0);
    //cin.tie(0);
    int t = read();
    int cas = 1;
    while(t--)
    {
        scanf("%s",s);
        int len = strlen(s);
        LL c,d,e;
        LL ans1 = -inf_ll,ans2 = -inf_ll,ans3 = -inf_ll;
        e = (LL)(s[len-1] - '0');
        d = (LL)(s[len-2] - '0');
        c = (LL)(s[len-3] - '0');
        LL res = c*d/e;
        //printf("res : %I64d\n",res);
        LL x,y = 0,p = 0,q;
        x = (s[0] - '0');
        for(int i=1;i<=len-4;i++)
        {
            y *= 10;
            LL ret = (LL)(s[i] - '0');
            y += ret;
        }
        //printf("x y : %I64d, %I64d\n",x,y);
        q = (s[len-4] - '0');
        for(int i=0;i<=len-5;i++)
        {
            p *= 10;
            LL ret = (LL)(s[i] - '0');
            p += ret;
        }
        //printf("p q : %I64d, %I64d\n",p,q);
        ans1 = max(x+y,p+q);
        ans1 = ans1 - res;
        //printf("ans : %I64d\n",ans);


        if(len>5)
        {
            e = (LL)(s[len-1] - '0') + (LL)(s[len-2] - '0') * 10;
            d = (LL)(s[len-3] - '0');
            c = (LL)(s[len-4] - '0');
            res = c*d/e;
            //printf("res : %I64d\n",res);
            y = 0,p = 0;
            x = (s[0] - '0');
            for(int i=1;i<=len-5;i++)
            {
                y *= 10;
                LL ret = (LL)(s[i] - '0');
                y += ret;
            }
            //printf("x y : %I64d, %I64d\n",x,y);
            q = (s[len-5] - '0');
            for(int i=0;i<=len-6;i++)
            {
                p *= 10;
                LL ret = (LL)(s[i] - '0');
                p += ret;
            }
            //printf("p q : %I64d, %I64d\n",p,q);
            ans2 = max(x+y,p+q);
            ans2 = ans2 - res;
            //printf("ans : %I64d\n",ans);

            if(len>6)
            {
                e = (LL)(s[len-1] - '0') + (LL)(s[len-2] - '0') * 10 + (LL)(s[len-3] - '0') * 100;
                d = (LL)(s[len-4] - '0');
                c = (LL)(s[len-5] - '0');
                res = c*d/e;
                //printf("res : %I64d\n",res);
                y = 0,p = 0;
                x = (s[0] - '0');
                for(int i=1;i<=len-6;i++)
                {
                    y *= 10;
                    LL ret = (LL)(s[i] - '0');
                    y += ret;
                }
                //printf("x y : %I64d, %I64d\n",x,y);
                q = (s[len-6] - '0');
                for(int i=0;i<=len-7;i++)
                {
                    p *= 10;
                    LL ret = (LL)(s[i] - '0');
                    p += ret;
                }
                //printf("p q : %I64d, %I64d\n",p,q);
                ans3 = max(x+y,p+q);
                ans3 = ans3 - res;
                //printf("ans : %I64d\n",ans);
            }

        }
        LL ans = max(ans1,max(ans2,ans3));

        printf("Case #%d: %I64d\n",cas++,ans);
     }


    return 0;
}