POJ 1821 - Fence
来源:互联网 发布:程序员注释 编辑:程序博客网 时间:2024/06/05 20:07
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.
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
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 43 2 23 2 33 3 51 1 7
Sample Output
17
题意:有 n 块木板,m 个员工来刷,每个员工坐在固定的 Si 块木板前面,能刷 Li 长度的木板,得到 Pi 的回报。问能得到的最大回报。
ans[i][j] 表示前 j 块木板截止到第 i 个员工得到的最大回报。
有3种状态转移:1.前 j 块木板由 i-1 个员工完成。
2.前 j-1 块木板由 i 个员工完成。
3.在第 k 块木板的时候由第 i 个员工接手,一直刷到 j 块木板。
然后使用优先队列进行DP优化,每次将在能够刷到范围的状态push进去,每次取最大收益。
#include <cstdio>#include <cstring>#include <queue>#include <algorithm>using namespace std;struct data{ int val, pos; bool operator < (const data &d) const { if (val != d.val) return val < d.val; else return pos > d.pos; } data() {} data(int v, int p) { val = v; pos = p; }};data tmp[16000 + 5];struct person{ int len, pri, sit; bool operator < (const person &p) { return sit < p.sit; }};person peo[100 + 5];int ans[100 + 5][16000 + 5];int main(){ int n, m; while (scanf("%d%d", &n, &m) != EOF) { for (int i = 1; i <= m; ++i) scanf("%d%d%d", &peo[i].len, &peo[i].pri, &peo[i].sit); peo[m+1].pri = 0; sort(peo+1, peo+m+1); memset(ans, 0, sizeof(ans)); for (int i = 1; i <= m; ++i) { int PRI = peo[i].pri; int LEN = peo[i].len; int SIT = peo[i].sit; priority_queue<data> Q; for (int j = max(SIT - LEN, 0); j < SIT; j++) Q.push(data(ans[i-1][j] - j*PRI, j)); for (int j = 1; j <= n; ++j) { ans[i][j] = max(ans[i-1][j], ans[i][j-1]); if (j < SIT || SIT + LEN + 1 < j) continue; while (!Q.empty() && Q.top().pos + LEN < j) Q.pop(); if (Q.empty()) continue; ans[i][j] = max(ans[i][j], Q.top().val + PRI*j); } } printf("%d\n", ans[m][n]); } return 0;}
0 0
- poj 1821 Fence
- POJ 1821 Fence
- POJ 1821 - Fence
- poj 1821 Fence
- POJ 1821 Fence
- 【DP POJ 1821】Fence
- POJ 1821 Fence 笔记
- POJ 1821 Fence 单调队列优化DP
- poj 1821 Fence(dp+单调队列优化)
- POJ 1821 Fence 【DP动态规划】
- (弃疗搁置)poj 1821 Fence
- poj 1821 Fence(dp单调队列优化)
- poj 1821 Fence(单调队列+dp)
- POJ 1821 Fence(单调队列优化)
- 单调队列1006 POJ 1821 Fence
- POJ 1821 Fence 单调队列优化dp
- POJ 3253 Fence Repair
- poj 3253 Fence Repair
- HDU1561 这应该也是一个很裸的树上背包...
- 解决Listview的Item与按钮或文本框焦点的问题
- Learning_neutron_command
- ReactiveCocoa入门教程——第二部分
- com.mchange.v2.resourcepool.TimeoutException: A client timed out while waiting to acquire a resource
- POJ 1821 - Fence
- 《从零开始学Swift》学习笔记(Day 25)——类和结构体定义
- Java String replace() 和 replaceAll()的用法
- 异步线程包装器
- 记录学习的点滴(Struts2的Action配置)
- 编译器内置宏
- objc - 编译Runtime源码objc4-680
- Android之PowerManager电源管理
- 字符串类之间转化 StringBuffer类-->String类 String类-->StringBuffer类