A12584 | Yet Another Partiton Problem
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given array $a_1, a_2, \dots, a_n$ . You need to split it into $k$ subsegments (so every element is included in exactly one subsegment).
The weight of a subsegment $a_l, a_{l+1}, \dots, a_r$ is equal to $(r - l + 1) \cdot \max\limits_{l \le i \le r}(a_i)$ . The weight of a partition is a total weight of all its segments.
Find the partition of minimal weight.
The weight of a subsegment $a_l, a_{l+1}, \dots, a_r$ is equal to $(r - l + 1) \cdot \max\limits_{l \le i \le r}(a_i)$ . The weight of a partition is a total weight of all its segments.
Find the partition of minimal weight.
输入格式
The first line contains two integers $n$ and $k$ ( $1 \le n \le 2 \cdot 10^4$ , $1 \le k \le \min(100, n)$ ) — the length of the array $a$ and the number of subsegments in the partition.
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 2 \cdot 10^4$ ) — the array $a$ .
The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ( $1 \le a_i \le 2 \cdot 10^4$ ) — the array $a$ .
输出格式
Print single integer — the minimal weight among all possible partitions.
输入输出样例
输入 #1
4 2 6 1 7 4
输出 #1
25
输入 #2
4 3 6 1 7 4
输出 #2
21
输入 #3
5 4 5 1 5 1 5
输出 #3
21
The optimal partition in the first example is next: $6$ $1$ $7$ $\bigg|$ $4$ .
The optimal partition in the second example is next: $6$ $\bigg|$ $1$ $\bigg|$ $7$ $4$ .
One of the optimal partitions in the third example is next: $5$ $\bigg|$ $1$ $5$ $\bigg|$ $1$ $\bigg|$ $5$ .
The optimal partition in the second example is next: $6$ $\bigg|$ $1$ $\bigg|$ $7$ $4$ .
One of the optimal partitions in the third example is next: $5$ $\bigg|$ $1$ $5$ $\bigg|$ $1$ $\bigg|$ $5$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted