hdu 2845 最长不连续子序列

dp[i] = max ( dp[i-2] + num[i]  , dp[i-1] )

没什么好解释的，经典模板题

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define MAX  200007

using namespace std;


int n,m;
int num[MAX];
int dp[MAX];
int row[MAX];
int sum[MAX];

int main ( )
{
    while ( ~scanf ( "%d%d" , &n , &m ) )
    {
        for ( int i = 0 ; i < n*m ; i++ )
            scanf ( "%d" , &num[i] );
        for ( int i = 1 ; i <= n ; i ++ )
        {
            sum[0] = 0;
            sum[1] = num[(i-1)*m];
            for ( int j = (i-1)*m+1 ; j < i*m ; j++ )
            {
                int id = j- (i-1)*m+1;
                sum[id] = max ( sum[id-2] + num[j] , sum[id-1] );
            }
            row[i] = sum[m];
        }
        dp[0] = 0;
        dp[1] = row[1];
        for ( int i = 2 ; i <= n ; i++ )
            dp[i] = max ( dp[i-2] + row[i] , dp[i-1] );
        printf ( "%d\n" , dp[n] );
    }
}