【杂题】 HDOJ 4974 A simple water problem

总和除2和最大值取最大就行了。。

#include <iostream>  
#include <queue>  
#include <stack>  
#include <map>  
#include <set>  
#include <bitset>  
#include <cstdio>  
#include <algorithm>  
#include <cstring>  
#include <climits>  
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 1005
#define maxm 40005
#define eps 1e-10
#define mod 998244353
#define INF 999999999
#define lowbit(x) (x&(-x))
#define mp mark_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid  
#define rson o<<1 | 1, mid+1, R  
typedef long long LL;
//typedef int LL;
using namespace std;
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(LL &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
// head

int n;
LL ans, mx, x;
void work(int __)
{
    mx = -1;
    ans = 0;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%I64d", &x);
        mx = max(mx, x);
        ans += x;
    }
    ans = (ans + 1) / 2;
    ans = max(ans, mx);
    printf("Case #%d: %I64d\n", __, ans);
}
int main(void)
{
    int _, __;
    while(scanf("%d", &_)!=EOF) {
        __ = 0;
        while(_--) {
            work(++__);
        }
    }
    return 0;
}