Danganronpa

最新推荐文章于 2017-04-16 19:04:29 发布

wanghandou

最新推荐文章于 2017-04-16 19:04:29 发布

阅读量294

点赞数

分类专栏：贪心算法

本文链接：https://blog.csdn.net/wanghandou/article/details/52205216

版权

贪心算法专栏收录该内容

16 篇文章 0 订阅

订阅专栏

Danganronpa

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0 Accepted Submission(s): 0

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

(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

Sample Output

  
  
   
   Case #1: 2
  
  
  
  
   
    题意：有n种礼物，每种礼物的个数为a[i],每个桌子代表一个人，每个桌子上放一个神秘礼物放一个普通礼物，相邻的桌子普通礼物种类不同，问最多有多少人拿到礼物：
  
  
  
  
   
   
    
    思路：
   
   每种礼物让他们自己又当神秘礼物又当普通礼物放一个桌子上面
  
  
  
  
   
   #include<stdio.h>
#include<algorithm>
using namespace std;
int a[10];
int main()
{
    int t;
    scanf("%d",&t);
    int g=0;
    while(t--)
    {
        g++;
        int n;
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            scanf("%d",&a[i]);
            int sum=0;
            int ni=0;
            int p=0;
            int h=0;
              printf("Case #%d: ",g);
            for(int i=0;i<n;i++)
            {
                if(a[i]==0)
                {
                    p++;
                }
                if(a[i]>=2)
                {
                    h=-1;
                }
                sum+=a[i]/2;
                ni+=a[i]%2;
            }
            if(p==n-1&&h==-1)
                printf("1\n");
              else  if(p==n-1&&h==0)
                    printf("0\n");
                else
                {
            sum+=ni/2;
            printf("%d\n",sum);
                }
    }
}