本文共 1393 字，大约阅读时间需要 4 分钟。
Today, Wet Shark is given n integers. Using any of these integers no more than once, Wet Shark wants to get maximum possible even (divisible by 2) sum. Please, calculate this value for Wet Shark.
Note, that if Wet Shark uses no integers from the n integers, the sum is an even integer 0.
The first line of the input contains one integer, n (1 ≤ n ≤ 100 000). The next line contains n space separated integers given to Wet Shark. Each of these integers is in range from 1 to 109, inclusive.
Print the maximum possible even sum that can be obtained if we use some of the given integers.
3 1 2 3
6
5 999999999 999999999 999999999 999999999 999999999
3999999996 题解：第一次打cf，写了两道水题，剩下的就完全没思路啊。。。 这个题让找给的数中可以加到的最大可以被2整除的数；水； 代码：
#include#include #include #include using namespace std;const int INF=0x3f3f3f3f;#define mem(x,y) memset(x,y,sizeof(x))#define SI(x) scanf("%d",&x)#define SL(x) scanf("%I64d",&x)#define PI(x) printf("%d",x)#define PL(x) printf("%I64d",x)#define P_ printf(" ")const int MAXN=1e5+100;int m[MAXN];int main(){ int n; while(~SI(n)){ __int64 ans=0,temp,top=0; for(int i=0;i
转载地址：http://kseaz.baihongyu.com/