HDU 5835 Danganronpa（贪心）

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

Problem Description
Chisa Yukizome works as a teacher in the school. She prepares many gifts, which consist of n kinds with a[i] quantities of each kind, for her students and wants to hold a class meeting. Because of the busy work, she gives her gifts to the monitor, Chiaki Nanami. Due to the strange design of the school, the students’ desks are in a row. Chiaki Nanami wants to arrange gifts like this:

1. Each table will be prepared for a mysterious gift and an ordinary gift.

2. In order to reflect the Chisa Yukizome’s generosity, the kinds of the ordinary gift on the adjacent table must be different.

3. There are no limits for the mysterious gift.

4. The gift must be placed continuously.

She wants to know how many students can get gifts in accordance with her idea at most (Suppose the number of students are infinite). As the most important people of her, you are easy to solve it, aren’t you?

Input
The first line of input contains an integer T(T≤10) indicating the number of test cases.

Each case contains one integer n. The next line contains n (1≤n≤10) numbers: a1,a2,…,an, (1≤ai≤100000).

Output
For each test case, output one line containing “Case #x: y” (without quotes) , where x is the test case number (starting from 1) and y is the answer of Chiaki Nanami’s question.

Sample Input
1
2
3 2

Sample Output
Case #1: 2

---

题意：
有n种礼物，每种礼物分别有a[i]种。这些礼物可以当做神秘礼物，也可以当做普通礼物来使用。现在要在一些连续的桌子上摆放礼物，摆放的要求是：
1.每个桌子必须有一个神秘礼物和一个普通礼物
2.相邻的两个桌子的普通礼物不能相同
3.神秘礼物不做要求

问最多能摆放多少个桌子。

解题思路：
首先每种方案的最大值为 sum/2。
对于其他方案的贪心做法：
将种类数最多的礼物间隔放，然后其他的礼物放在间隔处。

ans = min ( sum/2 , (sum - maxval) *2 + 1 ) .

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int N = 100;
int main()
{
        int T;
        scanf("%d",&T);
        for(int cas = 1; cas<=T ; cas++)
        {
                int n;
                scanf("%d",&n);
                int ans = 0,mx = 0;
                for(int i=1;i<=n;i++)
                {
                        int x;
                        scanf("%d",&x);
                        mx = max(x,mx);
                        ans += x;
                }
                printf("Case #%d: %d\n",cas,min(ans/2,(ans-mx)*2+1));
        }
        return 0;
}