动态规划——Little Red Riding Hood

题目描述

Once upon a time, there was a little girl. Her name was Little Red Riding Hood. One day, her grandma was ill. Little Red Riding Hood went to visit her. On the way, she met a big wolf. “That's a good idea.”，the big wolf thought. And he said to the Little Red Riding Hood, “Little Red Riding Hood, the flowers are so beautiful. Why not pick some to your grandma?” “Why didn't I think of that? Thank you.” Little Red Riding Hood said.

Then Little Red Riding Hood went to the grove to pick flowers. There were n flowers, each flower had a beauty degree a[i]. These flowers arrayed one by one in a row. The magic was that after Little Red Riding Hood pick a flower, the flowers which were exactly or less than d distances to it are quickly wither and fall, in other words, the beauty degrees of those flowers changed to zero. Little Red Riding Hood was very smart, and soon she took the most beautiful flowers to her grandma’s house, although she didn’t know the big wolf was waiting for her. Do you know the sum of beauty degrees of those flowers which Little Red Riding Hood pick? 

输入

The first line input a positive integer T (1≤T≤100), indicates the number of test cases. Next, each test case occupies two lines. The first line of them input two positive integer n and

k (2 <= n <= 10^5 ) ,1 <= k <= n ), the second line of them input n positive integers a (1<=a <=10^5)
输出

Each group of outputs occupies one line and there are one number indicates the sum of the largest beauty degrees of flowers Little Red Riding Hood can pick. 

样例输入

1
3 1
2 1 3
样例输出

5
题意概括：
有一排草地，种着一排花，每朵花都有它自己的魅力值，每摘取一朵花离它k距离之内的花就会枯萎，也就是魅力值变为0，问要取花的魅力值最大，问最大魅力值是多少？
解题思路：
标准的动态规划，从左往右从第一朵花开始取，每一次取花都更新，更新为倒数第k+1个花的最大魅力值加上当前花朵的最大魅力值，也就是每次存储的是取到当前花朵的最大魅力值，求到最后即为最大魅力值。

代码：

#include<stdio.h>
int max(int x,int y)
{
    if(x>y)return x;
    return y;
}
int a[101010],dp[101010];
int main()
{
    int t,m,n;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        int s;
        dp[0]=a[0];
        for(int i=1;i<n;i++)
        {
            if(i-m-1>=0)
                s=dp[i-m-1];
            else
                s=0;
            dp[i]=max(dp[i-1],s+a[i]);
        }
        printf("%d\n",dp[n-1]);
    }
    return 0;
}