code force 363B

Fence

There is a fence in front of Polycarpus's home. The fence consists of n planks of the same width which go one after another from left to right. The height of the i-th plank is hi meters, distinct planks can have distinct heights.
Fence for n = 7 and h = [1, 2, 6, 1, 1, 7, 1]

Polycarpus has bought a posh piano and is thinking about how to get it into the house. In order to carry out his plan, he needs to take exactly k consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such k consecutive planks that the sum of their heights is minimal possible.

Write the program that finds the indexes of k consecutive planks with minimal total height. Pay attention, the fence is not around Polycarpus's home, it is in front of home (in other words, the fence isn't cyclic).

#include<stdio.h>
#include<cmath>
#include<string.h>
#include<map>
#include<iostream>
#include<algorithm>
using namespace std;
int a[150001];
int dp[150001];
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)==2)
    {

        int mi=1000000000;

        int sum=0;
        int dd=1;

        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i];
            if(i>=m)
            {
                dp[i]=sum;//这里dp函数的意义是指在地i个数到他前m个数的这个区间里的所有数的总和，最后再判断一下最小值在输出就行了
                if(dp[i]<mi)
                {
                    mi=dp[i];
                    dd=i-m+1;
                }
            }
            sum-=a[i-m+1];
        }
        printf("%d\n",dd);
    }
}