CodeForces 363B Fence

最新推荐文章于 2024-07-28 21:06:44 发布

转载最新推荐文章于 2024-07-28 21:06:44 发布 · 177 阅读

1 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/crackpotisback/p/4619667.html

文章标签：

#java

本文介绍了一道算法题目，目标是在一系列不同高度的围栏中找出连续的k块围栏，使得这些围栏的高度之和最小，并给出了具体的解决方法及代码实现。

Fence

Time Limit: 1000ms

Memory Limit: 262144KB

This problem will be judged on CodeForces. Original ID: 363B
64-bit integer IO format: %I64d Java class name: (Any)

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.

$\text{[math]}$ 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.

Sample Input

Input

7 3
1 2 6 1 1 7 1

Output

Hint

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.

Source

Codeforces Round #211 (Div. 2)

解题：瞎搞

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 const int maxn = 200010;
 4 int n,k,sum[maxn];
 5 int main(){
 6     while(~scanf("%d %d",&n,&k)){
 7         int theMin = INT_MAX,idx = -1;
 8         for(int i = 1; i <= n; ++i){
 9             scanf("%d",sum+i);
10             sum[i] += sum[i-1];
11             if(i >= k && sum[i] - sum[i-k] < theMin){
12                 theMin = sum[i] - sum[i-k];
13                 idx = i - k + 1;
14             }
15         }
16         printf("%d\n",idx);
17     }
18     return 0;
19 }