【算法入门】单调队列优化动态规划:[RomaniaOI2002]Fence

Problem

Description
A team of k (1 <= K <= 100) workers should paint a fence which contains N (1 <= N <= 16 000) planks numbered from 1 to N from left to right. Each worker i (1 <= i <= K) should sit in front of the plank Si 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 Pi $ (1 <= Pi <= 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.
Input
The input contains:
Input
N K
L1 P1 S1
L2 P2 S2
…
LK PK SK
Semnification
N -the number of the planks; K ? the number of the workers
Li -the maximal number of planks that can be painted by worker i
Pi -the sum received by worker i for a painted plank
Si -the plank in front of which sits the worker i
Output
The output contains a single integer, the total maximal income.
Sample Input
8 4
3 2 2
3 2 3
3 3 5
1 1 7
Sample Output
17

---

Solution

• 拿到这道题以后，对si排序是一定的。这样才能保证算法的有序性。
• 对于这道题，考虑最简单的DP，设$f[i][j]$为前i个木匠，粉刷到第j块木板的最大收益。
• $①$当第$i$个木匠一块也不刷时：$f[i][j]=f[i-1][j]$
  $②$当第$i$个木匠不粉刷第j块时：$f[i][j]=f[i][j-1]$
  $③$第$i$块木匠粉刷第$j$块时，从第$k+1$块粉刷到$j$：
  此时要满足位置关系：$k+1\le Si\le j$；也要满足长度关系：$j</$