zoukankan      html  css  js  c++  java
  • Codeforces 797B

    B. Odd sum
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    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.

    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.

    Examples
    input
    4
    -2 2 -3 1
    output
    3
    input
    3
    2 -5 -3
    output
    -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=0;
            int index1=-1,index2=-1;
            int sum1=-0x7f7f7f7f,sum2=-0x7f7f7f7f;
            cin>>n;
            for(int i=0;i<n;i++)
            {
                cin>>a[i];
                if(a[i]>0)
                {
                    sum+=a[i];
                    if(a[i]%2)
                    {
                        temp2=min(temp2,a[i]);
                    }
                }
                else if(a[i]<0)
                {
                    if(a[i]%2)
                    temp1=max(temp1,a[i]);
                }
            }
                if(sum%2)cout<<sum<<endl;
                else
                {
                        sum1=sum-temp2;
                        sum2=sum+temp1;
                    cout<<max(sum1,sum2)<<endl;
                }
                return 0;
    }

    有点乱,我是输入的时候就找最大负奇数和最小正奇数的。

  • 相关阅读:
    翻译MDN里js的一些方法属性
    ajax相关
    我的面试错题
    写代码通用思路
    工厂模式
    cookie & session
    X-UA-Compatible设置IE浏览器兼容模式
    [转]IE6/IE7/IE8/IE9中tbody的innerHTML不能赋值的完美解决方案
    EasyUseCase 一款脑图转化 Excel 测试用例工具 (1.2 版本升级)
    XMind2TestCase:一个高效测试用例设计的解决方案!
  • 原文地址:https://www.cnblogs.com/widsom/p/6720400.html
Copyright © 2011-2022 走看看