CodeForces 363B - Fence

本文介绍了一种算法,用于从一系列不同高度的围栏中找到连续的k块围栏,使其总高度最小。该问题源自将钢琴通过围栏缺口搬进家中的场景,通过计算连续部分围栏的高度总和来解决。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

There is a fence in front of Polycarpus's home. The fence consists of n planks of the same width which go one afteranother 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 itinto the house. In order to carry out his plan, he needs to take exactly k consecutive planks from the fence. Higher planksare harder to tear off the fence, so Polycarpus wants to find such k consecutive planks that the sum of their heightsis minimal possible.

Write the program that finds the indexes of k consecutive planks with minimal total height. Pay attention, the fenceis not around Polycarpus's home, it is in front of home (in other words, thefence 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 thefence and the width of the hole for the piano. The second line contains thesequence 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 suchj's, printany of them.

Sample test(s)

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 theminimum sum of heights. In the given case three planks with indexes 3, 4 and 5have the required attribute, their total height is 8.

 

思路:

找n个数中连续k个和最小


代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
	int n, k;
	int a[150005];

	while (scanf("%d%d", &n, &k) != EOF)
	{
		int i, minn;
		memset(a, 0, sizeof(a));

		int flag = 1;

		for (i = 1; i<k; i++)
		{
			scanf("%d", &a[i]);
			a[i] += a[i - 1];
		}

		int temp;
		for (; i <= n; i++)
		{
			scanf("%d", &a[i]);
			a[i] += a[i - 1];
			temp = a[i] - a[i - k];
			if (temp<minn)
			{
				minn = temp;
				flag = i - k + 1;
			}
		}

		printf("%d\n", flag);
	}

	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值