B. Odd sum
来源:互联网 发布:mac ladybug是什么意思 编辑:程序博客网 时间:2024/06/01 16:31
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.
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.
Print sum of resulting subseqeuence.
4-2 2 -3 1
3
32 -5 -3
-1
In the first example sum of the second and the fourth elements is 3.
数组排序一下,同时可以想到,该序列最大的子序列和一定是所有正数的和,要找最大子序列的奇数和,只需要判断该所有正数的和,如果为奇数,直接输出,否则找到绝对值最小的一个奇数,然后用和减去该数即可;
代码如下:
//// main.cpp// B. Odd sum//// Created by 徐智豪 on 2017/4/15.// Copyright © 2017年 徐智豪. All rights reserved.//#include <iostream>#include <algorithm>#include <cmath>#include <stdio.h>#include <queue>using namespace std;int main(int argc, const char * argv[]) { priority_queue<int> jishu; int n; cin>>n; int x; long long maxsum=0; for(int i=1;i<=n;i++) { cin>>x; if(x>=0) { maxsum+=x; if(x%2) jishu.push(-x); } else { if(x%2) jishu.push(x); } } if(maxsum%2) cout<<maxsum<<endl; else cout<<maxsum+jishu.top()<<endl; return 0;}
- B. Odd sum
- CodeForces 797B Odd sum
- codeforces 797B Odd sum
- Codeforces 797B Odd sum
- Educational Codeforces Round 19 B. Odd sum
- 【CodeForces 797B】Odd sum(模拟)
- Educational Codeforces Round 19 B. Odd sum
- codeforces——797B——Odd sum
- uva10783 Odd Sum
- UVa 10783 - Odd Sum
- UVA 10783 - Odd Sum
- UVa 10783-Odd Sum
- Odd sum CF
- Sicily 12986. An Odd Sum
- Sum All Odd Fibonacci Numbers
- Sum All Odd Fibonacci Numbers
- CodeWars:Sum of odd numbers
- Sum All Odd Fibonacci Numbers
- 创建型设计模式之抽象工厂方法模式
- 安装caffe的每一个小问题
- 170417 汇编-除法防溢出和数值显示的子程序实操
- dubbo源码分析-RPC远程调用模块与Remoting通讯模块协作细节
- 对象混合
- B. Odd sum
- 关于获得时间的Date用法
- 贪心法——C语言实现最小代价生成树
- CF-Codeforces Round #409 (rated, Div. 2, based on VK Cup 2017 Round 2)-C-Voltage Keepsake
- python正则表达式入门
- SEM经验-3
- maven--私服的搭建(Nexus的使用)和注意的问题
- 455
- 第六弹:微信小程序开发思考总结—“文章阅读器和电影信息”项目实践---项目结束和补充总结