A815.Even More Odd Photos--Bronze

普及-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

Farmer John is yet again trying to take a photograph of his NN cows (2N10002 \leq N \leq 1000).
Each cow has an integer "breed ID" number in the range 11001 \ldots 100. Farmer
John has a very peculiar idea in mind for his photo: he wants to partition all
the cows into disjoint groups (in other words, place each cow in exactly one
group) and then line up the groups so the sum of the breed IDs of the cows in
the first group is even, the sum of the IDs in the second group is odd, and so
on, alternating between even and odd.
What is the maximum possible number of groups Farmer John can form?

输入格式

The first line of input contains NN. The next line contains NN space-
separated integers giving the breed IDs of the NN cows.

输出格式

The maximum possible number of groups in Farmer John's photo. It can be shown
that at least one feasible grouping exists.

输入输出样例

  • 输入#1

    7
    1 3 5 7 9 11 13
    

    输出#1

    3
    

说明/提示

In this example, one way to form the maximum number of three groups is as
follows. Place 1 and 3 in the first group, 5, 7, and 9 in the second group,
and 11 and 13 in the third group.

首页