Uberwatch Gym - 101873I

AC代码（dp 纪念一下第一次做dp的题目）

Select Code

#include <iostream>
#include <map>
#include <bits/stdc++.h>
#define maxn 300010
using namespace std;
int dp[maxn];
int a[maxn];
int mx[maxn];
int main()
{
    int n, m, maxx = 0, i;
    scanf("%d %d",&n, &m);
    for(i = 1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i = m+1;i<=n;i++)
    {
        dp[i] = a[i];
    }
    maxx = dp[m+1];
    mx[m+1] = dp[m+1];
    for(i = m+2;i<=n;i++)
    {
        dp[i] = mx[i-m]+a[i]; //这一时刻出了大招
        mx[i] = max(dp[i], mx[i-1]); //此刻用和不用那个杀得怪多
        maxx = max(dp[i], maxx);
    }
    printf("%d\n",maxx);
    return 0;
}