Codeforces 797B 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.

题意
给出n个数字，求和为奇数的最大值

分别维护和为奇数及和为偶数的最大值
a[i]为奇数时
sum[i][1]=max(a[i] , sum[i][0]+a[i] , sum[i-1][1])
sum[i][0]=max(sum[i][1]+a[i] , sum[i-1][0])
a[i]为偶数时
sum[i][1]=max(sum[i][1]+a[i] , sum[i-1][1])
sum[i][0]=max(a[i] , sum[i][0]+a[i] , sum[i-1][0])

AC代码

#include<stdio.h>
#include<algorithm>
using namespace std;

const int maxn=1e6+5;
int n,a[maxn],sum[maxn][2];

int main()
{
    scanf("%d",&n);
    for (int i=0;i<n;i++) scanf("%d",&a[i]);
    if (a[0] % 2)
        sum[0][1]=a[0];
    else
        sum[0][0]=a[0];
    for (int i=1;i<n;i++)
    if (a[i] % 2)
    {
        if (sum[i-1][1]==0)
        {
            sum[i][0]=sum[i-1][0];
            sum[i][1]=max(a[i],sum[i][0]+a[i]);
        }
        else
        {
            sum[i][0]=max(sum[i-1][1]+a[i],sum[i-1][0]);
            sum[i][1]=max(a[i],max(sum[i-1][0]+a[i],sum[i-1][1]));
        }
    }
    else
    {
        sum[i][0]=max(a[i],max(sum[i-1][0]+a[i],sum[i-1][0]));
        if (sum[i-1][1]!=0)
            sum[i][1]=max(sum[i-1][1]+a[i],sum[i-1][1]);
    }
    printf("%d",sum[n-1][1]);
    return 0;
}