HDU DP 简单题

横竖分别求一下 最大不连续子段和即可

#include "stdio.h"
#include "string.h"
int dp[200001];
struct comp
{
    int no,yes;
}b[2];

int Max(int a,int b)
{
    if (a<b) return b;
    else return a;
}
int main()
{
    int n,m,x,i,j;

    while(scanf("%d%d",&n,&m)!=EOF)
    {
        for (i=1;i<=n;i++)
        {
            memset(b,0,sizeof(b));
            for (j=1;j<=m;j++)
            {
                scanf("%d",&x);
                b[j%2].no=Max(b[1-j%2].yes,b[1-j%2].no);
                b[j%2].yes=b[1-j%2].no+x;
            }
            dp[i]=Max(b[m%2].no,b[m%2].yes);
        }

        memset(b,0,sizeof(b));
        for (i=1;i<=n;i++)
        {
            b[i%2].no=Max(b[1-i%2].yes,b[1-i%2].no);
            b[i%2].yes=b[1-i%2].no+dp[i];
        }
        printf("%d\n",Max(b[n%2].yes,b[n%2].no));
    }
    return 0;
}