POJ1821 Fence 题解报告

最新推荐文章于 2024-11-13 17:54:23 发布

_Youngyx

最新推荐文章于 2024-11-13 17:54:23 发布

阅读量170

点赞数 1

分类专栏：题解文章标签：动态规划算法

本文链接：https://blog.csdn.net/young_1217/article/details/124948586

版权

该博客介绍了如何使用动态规划和优先队列优化解决一道关于分配工作以最大化收入的题目。文章详细阐述了暴力解法的时间复杂度问题，并提出通过维护一个单调队列来优化状态转移，从而降低时间复杂度，实现高效求解最大收入的方案。

摘要由CSDN通过智能技术生成

传送门

1 题目描述

A team of $k (1 <= K <= 100) $workers should paint a fence which contains $N (1 < = N < = 16000)$ planks numbered from $1$ to $N$ from left to right. Each worker $i (1 < = i < = K)$ should sit in front of the plank $S_i$ and he may paint only a compact interval (this means that the planks from the interval should be consecutive). This interval should contain the Si plank. Also a worker should not paint more than Li planks and for each painted plank he should receive $P_i (1 <= P_i <= 10 000)$ . A plank should be painted by no more than one worker. All the numbers Si should be distinct.

Being the team’s leader you want to determine for each worker the interval that he should paint, knowing that the total income should be maximal. The total income represents the sum of the workers personal income.

Write a program that determines the total maximal income obtained by the K workers.

有 $N$ 块木板从左至右排成一行,有