68
自己看吧。
#include <stdio.h>#include <string.h>#define INF 0x7fffffff#define MAX 1000100int dp[MAX] , num[MAX] , preMax[MAX];int max(int a , int b){return a>b?a:b ;}int main(){int m , n;while(~scanf("%d%d",&m,&n)){for(int i = 1 ; i <= n ; ++i){scanf("%d",&num[i]) ;preMax[i] = 0 ;dp[i] = 0 ;}dp[0] = 0 ;preMax[0] = 0 ;int mm ;for(int i = 1 ; i <= m ; ++i){mm = -INF;for(int j = i ; j <= n ; ++j){dp[j] = max(dp[j-1]+num[j],preMax[j-1]+num[j]) ;preMax[j-1] = mm ;mm = max(dp[j],mm) ;}}printf("%d\n",mm) ;}return 0 ;}
，孤独是一种无奈的选择，孤独是因为没有找到合适的同行者，
