习题8-22(uva-1622)

#include<cstdio>
#include<algorithm>
#define REP(i, a, b) for(int i = (a); i < (b); i++)
using namespace std;
typedef long long ll;
 
ll solve(ll x, ll y, ll n, ll s, ll w, ll e)
{
    
    
	ll res = 0;
	if(s > n) swap(s, n);
	if(e > w) swap(e, w);
	
	if(n)   //东西来回 
	{
    
    
		res += x * y;
		x--; n -= s;
		if(n) res += x * y * s * 2, n--;
		else res += x * y * (s * 2 - 1);
		s = 0;
	}
	
	if(w)  //判断向南北还是向西 
	{
    
    
		w -= e;
		if(w) e *= 2, w--;
		else e = e * 2 - 1;
		while((1 - y) * e >= y - x && n) //两串很长的公式最后的化简结果 
		{
    
    
			res += x * y;
			n--; x--;
		}
		res += x * y; y--;
		res += x * y * e; e = 0;
	}
	
	while(x * y > 0 && n + w > 0)  //剩下的处理掉 
	{
    
    
		res += x * y;
		if((x > y && n) || !w) n--, x--;
		else w--, y--;
	}
	
	return res;
}
 
int main()
{
    
    
	int kase = 0;
	ll x, y, n, s, w, e; //要开long long 
	while(~scanf("%lld%lld", &x, &y) && x && y)
	{
    
    
		scanf("%lld%lld%lld%lld", &n, &s, &w, &e);
		ll res = max(solve(x, y, n, s, w, e), solve(y, x, e, w, n, s)); //两种情况都做一遍取最大 
		printf("Case %d: %lld\n", ++kase, res);
	}
	return 0;
}