CodeForces
来源:互联网 发布:手机去广告软件 编辑:程序博客网 时间:2024/06/06 03:10
Odd sum
You are given sequence a1, a2, …, an of integer numbers of length n. Your task is to find such subsequence that its sum is odd and maximum among all such subsequences. It’s guaranteed that given sequence contains subsequence with odd sum.
Subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.
You should write a program which finds sum of the best subsequence.
Input
The first line contains integer number n (1 ≤ n ≤ 105).
The second line contains n integer numbers a1, a2, …, an ( - 104 ≤ ai ≤ 104). The sequence contains at least one subsequence with odd sum.
Output
Print sum of resulting subseqeuence.
Example
Input
4
-2 2 -3 1
Output
3
Input
32 -5 -3
Output
-1
Note
In the first example sum of the second and the fourth elements is 3.
不难的题目,却不知为何一直调不对,场下一次就做对了,唉都是泪
#include<bits/stdc++.h>using namespace std;int main(){ int n; int num[100005]; int num2[100005]; int x=0;int j=0; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&num[i]); } int sum; for(int i=0;i<n;i++) { if(x<=x+num[i]) {x+=num[i]; num2[j++]=num[i]; num[i]=0; } } if(x&1) cout<<x<<endl; else { int x2=x; sort(num,num+n); sort(num2,num2+j); for(int i=0;i<j;i++) { if(num2[i]&1) {x2-=num2[i];break;} } for(int i=n-1;i>=0;i--) { if(num[i]&1) { x+=num[i]; break; } } int x3=max(x,x2); if(x3&1) cout<<x3<<endl; else cout<<min(x,x2)<<endl; }}
- codeforces~~~
- Codeforces
- codeforces
- Codeforces
- codeforces
- codeforces
- Codeforces
- Codeforces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- CodeForces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- Codeforces
- BZOJ 3196: Tyvj 1730 二逼平衡树(一起来码树套树)
- 智能指针
- 聚焦大数据:洞察价值与企业应用落地
- 深入理解脚本化CSS系列第一篇——脚本化行内样式
- 动态规划求编辑距离——算法解题报告
- CodeForces
- YTU.2431: C语言习题 医生值班
- layui回调函数
- Mybatis(一):Mybatis基础架构和入门案例
- RedisTemplate序列化
- Java类静态属性、静态块、非静态属性、非静态块、构造函数在初始化时的执行顺序
- Java设计模式百例
- day 37 rsync工具
- 26进制转换 boj1237