牧场栅栏 - Problem

#22767. 牧场栅栏

Statistics

Farmer John 长栅栏由柱和横杆组成，$N$（$1 \le N \le 3000$）根柱各标 $-1000$ 到 $+1000$ 的数，可重复。奶牛反刍时发明游戏，找到“最佳栅栏和”者得冰淇淋甜点。

获胜牛须找和绝对值最小的连续柱段中最长者。请帮求获胜和。

输入格式

第 1 行：整数 $N$。
第 $2..N+1$ 行：各行柱标签，第 2 行是编号 1 的值，依此类推。

输出格式

一行三个数：

首根求和柱编号；
最后求和柱编号；
柱标签和的绝对值。若多个序列最佳和相同且都为最大长度，输出首编号最小者。

样例

输入格式 1

输出格式 1

4 6 0

题目作者：Dominic Battre，2001

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0