CF332B.Maximum Absurdity

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

The first line contains two integers $n$ and $k$ ( $2<=n<=2·10^{5}$ , 0<2k<=n ) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains $n$ integers $x_{1},x_{2},...,x_{n}$ — the absurdity of each law ( $1<=x_{i}<=10^{9})$ .

输入格式

Print two integers $a$ , $b$ — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments $[a; a+k-1]$ and $[b; b+k-1]$ . If there are multiple solutions, print the one with the minimum number $a$ . If there still are multiple solutions, print the one with the minimum $b$ .

输出格式

In the first sample mr. Boosch signs laws with numbers from segments [1;2] and [4;5]. The total absurdity of the signed laws equals $3+6+1+6=16$ .

In the second sample mr. Boosch signs laws with numbers from segments [1;2] and [3;4]. The total absurdity of the signed laws equals $1+1+1+1=4$ .

输入输出样例

输入#1
```
5 2
3 6 1 1 6
```
输出#1
```
1 4
```
输入#2
```
6 2
1 1 1 1 1 1
```
输出#2
```
1 3
```

说明/提示

In the first sample mr. Boosch signs laws with numbers from segments [1;2] and [4;5]. The total absurdity of the signed laws equals $3+6+1+6=16$ .

In the second sample mr. Boosch signs laws with numbers from segments [1;2] and [3;4]. The total absurdity of the signed laws equals $1+1+1+1=4$ .

首页