Codeforces 797B - Odd sum
1 second
256 megabytes
standard input
standard output
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
3
2 -5 -3
-1
题目大意:求最大奇数和的子序列的和。
方法:先将正数加起来,得sum
如果sum为奇数,输出sum;
否则,sum1=sum-最小正奇数,sum2=sum+最大负奇数,输出max(sum1,sum2)。
代码:
#include<iostream>
#include<cstdio>
#include<cmath>
#include<iostream>
#define ll long long
using namespace std;
const int N=1e5;
int a[N];
int temp1=-1e5,temp2=1e5;
int main()
{
int n;
int sum=;
int index1=-,index2=-;
int sum1=-0x7f7f7f7f,sum2=-0x7f7f7f7f;
cin>>n;
for(int i=;i<n;i++)
{
cin>>a[i];
if(a[i]>)
{
sum+=a[i];
if(a[i]%)
{
temp2=min(temp2,a[i]);
}
}
else if(a[i]<)
{
if(a[i]%)
temp1=max(temp1,a[i]);
}
}
if(sum%)cout<<sum<<endl;
else
{
sum1=sum-temp2;
sum2=sum+temp1;
cout<<max(sum1,sum2)<<endl;
}
return ;
}
有点乱,我是输入的时候就找最大负奇数和最小正奇数的。
最新文章
- 【Django】--Models 和ORM以及admin配置
- 解决 Gnome3 窗口背景是黑色的问题
- Laravel学习笔记(六)数据库 数据库填充
- Corporative Network_并查集
- DoTween使用
- springmvc+hibernate入门-揭开神秘的面纱
- HW6.13
- java1.8的几大新特性(二)
- PostMessage 向Windows窗口发送Alt组合键
- 《JavaScript 高级程序设计》读书笔记五 引用类型
- scrapy 基础
- Spring Boot 启动:No active profile set, falling back to default profiles: default
- Caffe和py-faster-rcnn日常使用备忘录
- [UE4]Size Box
- 与元素类型 ";item"; 相关联的 ";name"; 属性值不能包含 &#39;<;&#39; 字符。
- JAVA框架 Spring junit整合单元测试
- LA 3644 易爆物
- Docker实战(八)之Web服务与应用
- 【转】嵌入式Linux驱动面试题三道
- sum函数