ACM1024动态规划

#include <cstdio>
#include <algorithm>
#define FI(a, b, c) for(int a = (b); a <= (c); a++)
#define FD(a, b, c) for(int a = (b); a >= (c); a--)
using namespace std;

int n, m, t;
long long d[], l[];

int main(){
    while(scanf("%d %d", &m, &n) != EOF){
        FI(i, , m) d[i] = l[i] = -1e15;

        while(n--){
            scanf("%d", &t);
            FD(i, m, ){
                d[i] = max(d[i], l[i - ]) + t;
                l[i] = max(l[i], d[i]);
            }
        }
        printf("%d\n", l[m]);
    }
}