机器人吃苹果

暴力思路：
走楼梯dp；完全一致的思路；
代码如下：

#include<iostream>
#include<vector>
using namespace std;
typedef long long int lli;
int n,m;
vector<lli> A;int main(){cin >> n >> m;A.push_back(0);for(int i = 1;i <=m;i++){lli temp;cin >> temp;A.push_back(temp);}vector<lli>dp(n+1);//1-n//写出dp[i],i is [1,m];dp[1]=A[1];// printf("dp[1]is: %d\n",dp[1]);for(int i = 2; i <= m;i++){dp[i] = 0;for(int j = 1;j < i;j++){lli temp = max(A[i],dp[i-j]+dp[j]);dp[i] = max(temp,dp[i]);}// printf("dp[%d]is: %d\n",i,dp[i]);}for(int i = m+1;i <= n;i++){dp[i] = 0;for(int j = 1;j <= m;j++){dp[i] = max(dp[i],dp[i-j]+dp[j]);}// printf("dp[%d]is: %d\n",i,dp[i]);}cout << dp[n] <<endl;
}