codeforces 363B Fence

​​点击打开链接​​

B. Fence

time limit per test

memory limit per test

input

output

n planks of the same width which go one after another from left to right. The height of the i-th plank is hi

Fence for n = 7 and h = [1, 2, 6, 1, 1, 7, 1]

k consecutive planks from the fence. Higher planks are harder to tear off the fence, so Polycarpus wants to find such k

k

Input

n and k (1 ≤ n ≤ 1.5·105, 1 ≤ k ≤ n) — the number of planks in the fence and the width of the hole for the piano. The second line contains the sequence of integers h1, h2, ..., hn (1 ≤ hi), where hi is the height of the i-th plank of the fence.

Output

j that the sum of the heights of planks j, j + 1, ..., j + k - 1 is the minimum possible. If there are multiple such j's, print any of them.

Examples

input

7 3
1 2 6 1 1 7 1

output

3

Note

In the sample, your task is to find three consecutive planks with the minimum sum of heights. In the given case three planks with indexes 3, 4 and 5 have the required attribute, their total height is 8.

暴力

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int a[150005];
    int temp,pre=0;
    int i,n,k;
    scanf("%d%d",&n,&k);
    for(i=0;i<n;i++)
    {
        scanf("%d",&temp);
        a[i]=temp+pre;
        pre=a[i];
    }
    int mi=a[k-1],seat=0;
    for(i=0;i<n-k;i++)
    {
        int w=a[i+k]-a[i];
        //printf("#%d %d\n",mi,w);
        if(mi>w)
        {
            mi=w;
            seat=i+1;
        }
        //printf("#%d %d\n",mi,w);
    }
    printf("%d\n",seat+1);
    return 0;
}