Fence

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).
Input
The first line of the input contains integers 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 ≤ 100), where hi is the height of the i-th plank of the fence.
Output
Print such integer 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.
Example

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.
题意：输入两个数n，k，当连续k个数相加有最小序列和时，输出最小序列中第一个数所在的位置。
方法：依次把相应区间的数加起来，注意只能用一次for循环，并且学会使用技巧来处理问题。
难点：如何剔除第一个数，来再加一个数，来进行两组数据的比较。具体代码如下：

#include"iostream"
#include"string.h"
#include"algorithm"
using  namespace std;
int xx[150001];
int main()
{
     int n,k;
     while(cin>>n>>k)
     {
           int a=0;
           int b=0;
           int c=0;
           for(int i =0;i<n;i++)
           {
               cin>>xx[i];
               a=a+xx[i];
               if(i==k-1)
               {
                    b=a;
                    a=a-xx[i-k+1];
                    c=i-k+2;
               }
               if(i>k-1)
               {
                  if(a<b)
                  {
                     b=a;
                     c=i-k+2;
                  }
                  a=a-xx[i-k+1];
               }
           }
           cout<<c<<endl;
     } 
     return 0;
}