洛谷P1353 [USACO08JAN]跑步Running

洛谷P1353 [USACO08JAN]跑步Running

#include <bits/stdc++.h> 
#define For(i,j,k) for(int i=j;i<=k;i++) 
using namespace std ; 

const int N = 10011,M=511,inf = 1e9 ; 
int f[N][M],d[N] ; 
int n,m ; 

inline int read() 
{
    int x = 0 , f = 1 ; 
    char ch = getchar() ; 
    while(ch<'0'||ch>'9') { if(ch=='-') f = -1 ; ch = getchar() ; } 
    while(ch>='0'&&ch<='9') { x = x * 10+ch-48 ; ch = getchar() ; } 
    return x * f ;  
}

int main() 
{
    n = read() ; m = read() ; 
    For(i,1,n) d[i]=read() ; 
    //For(i,0,n) f[1][i]=-inf ; f[1][1] = d[1] ; f[1][0] = 0 ; 
    For(i,1,n) {
      For(j,1,min(i,m)) 
          f[i][0]=max(f[i][0],f[i-j][j]) ;     
      f[i][0]=max(f[i][0],f[i-1][0]) ;     
      for(int j=m;j>=1;j--)
          f[i][j]=max(f[i][j],f[i-1][j-1]+d[i]) ; 
    }
    printf("%d
",f[n][0]) ; 
    return 0 ; 
}