带有时间间隔的dp

Uberwatch

题意：一个人打一群敌人，每间隔时间m能释放一次大招，消灭这个时刻上的所有敌人，起始时刻开始计算冷却时间

solution:

dp[i]=max(dp[i],dp[i-m]);

 /*************************************************************************
     > File Name: a.cpp
     > Author: QWX
     > Mail:
     > Created Time: 2018/10/17 20:07:36
  ************************************************************************/

 //{{{ #include
 #include<iostream>
 #include<cstdio>
 #include<algorithm>
 #include<vector>
 #include<cmath>
 #include<queue>
 #include<map>
 #include<set>
 #include<string>
 #include<cstring>
 #include<complex>
 #include<cassert>
 //#include<bits/stdc++.h>
 #define vi vector<int>
 #define pii pair<int,int>
 #define mp make_pair
 #define pb push_back
 #define first fi
 #define second se
 #define pw(x) (1ll << (x))
 #define sz(x) ((int)(x).size())
 #define all(x) (x).begin(),(x).end()
 #define rep(i,l,r) for(int i=(l);i<(r);i++)
 #define per(i,r,l) for(int i=(r);i>=(l);i--)
 #define FOR(i,l,r) for(int i=(l);i<=(r);i++)
 #define cl(a,b) memset(a,b,sizeof(a))
 #define fastio ios::sync_with_stdio(false);cin.tie(0);
 #define lson l , mid , ls
 #define rson mid + 1 , r , rs
 #define INF 0x3f3f3f3f
 #define LINF 0x3f3f3f3f3f3f3f3f
 #define ll long long
 #define ull unsigned long long
 #define dd(x) cout << #x << " = " << (x) << ","
 #define de(x) cout << #x << " = " << (x) << "\n"
 #define endl "\n"
 using namespace std;
 //}}}

 const int N=3e5+;
 int a[N];
 int dp[N]; 

 int main()
 {
     int n,m; cin>>n>>m;
     FOR(i,,n)cin>>a[i];
     FOR(i,m+,n){
         dp[i]=max(dp[i-],dp[i-m]+a[i]);
 //        de(dp[i]);
     }
     cout<<dp[n]<<endl;
     return ;
 }