ZUFEOJ Home ProblemSet Source/Category Contest Status Ranklist F.A.Qs
Login Register

4553: Array Covering

内存限制：256 MB 时间限制：2 S
题面：传统 评测方式：文本比较 上传者：
提交：1 通过：1
提交提交记录统计Web Board

题目描述

time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Misha has an array of integers of length n. He wants to choose k different continuous subarrays, so that each element of the array belongs to at least one of the chosen subarrays.
Misha wants to choose the subarrays in such a way that if he calculated the sum of elements for each subarray, and then add up all these sums, the resulting value was maximum possible.
Input
The first line of input contains two integers: n, k (1≤n≤100000, 1≤k≤n·(n+1)/2)− the number of elements in the array and the number of different subarrays that must be chosen.
The second line contains n integers ai (-50000≤ai≤50000)− the elements of the array.
Output
Output one integer− the maximum possible value Misha can get by choosing k different subarrays.
Example
Input
5 4
6 -4 -10 -4 7
Output
11

输入样例 复制

输出样例 复制

分类标签