hdu 5380 Travel with candy(双端队列)
来源:互联网 发布:周灏 金融大数据 编辑:程序博客网 时间:2024/06/02 22:06
题目链接:hdu 5380 Travel with candy
保持油箱一直处于满的状态,维护一个队列,记录当前C的油量中分别可以以多少价格退货,以及可以推货的量。每到一个位置,可以该商店的sell值更新队列中所有价格小于sell的(还没有卖)。用buy值更新队列中大于buy(卖掉了)。移动所消耗的油从价格最低的开始。
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;typedef long long ll;const int maxn = 2 * 1e5 + 5;ll ans;int N, C, L, R, D[maxn], S[maxn], B[maxn], W[maxn * 2], V[maxn * 2];void init () {scanf("%d%d", &N, &C);for (int i = 1; i <= N; i++)scanf("%d", &D[i]);for (int i = 0; i <= N; i++)scanf("%d%d", &B[i], &S[i]);}void merge(int s) {int v = 0;while (L <= R && W[L] <= s)v += V[L++];if (v) {W[--L] = s;V[L] = v;}}int sell (int s) {int ret = 0;while (L <= R && W[R] >= s) {ans -= 1LL * V[R] * W[R];ret += V[R--];}return ret;}void consume(int v) {while (v) {int k = min(V[L], v);v -= k;V[L] -= k;if (V[L] == 0)L++;}}void solve () {ans = 0;L = N, R = N - 1;;for (int i = 0; i < N; i++) {merge(S[i]);int add = (i == 0 ? C : D[i] - D[i-1]);add += sell(B[i]);W[++R] = B[i];V[R] = add;ans += 1LL * B[i] * add;consume(D[i+1] - D[i]);}merge(S[N]);while (L <= R) {ans -= 1LL * W[L] * V[L];L++;}}int main () {int cas;scanf("%d", &cas);while (cas--) {init ();solve ();printf("%lld\n", ans);}return 0;}
1 0
- hdu 5380 Travel with candy(双端队列)
- HDU 5380 Travel with candy 单调队列
- hdu 5380 Travel with candy 贪心&队列
- HDU 5380 Travel with candy (单调队列&贪心)
- hdu 5380 Travel with candy (单调队列)@
- hdu 5380 Travel with candy 单调队列 2015 Multi-University Training Contest 8
- 2015多校第8场 HDU 5380 Travel with candy 贪心,单调队列
- HDU5380 Travel with candy
- hdu 2433 Travel(spfa)
- hdu Travel
- hdu-travel
- Travel HDU
- Travel HDU
- Travel HDU
- HDU 4465 Candy(概率)
- HDU 4465 Candy (概率)
- Candy HDU
- HDU 4284--Travel(状压dp+TSP)
- java文件预览
- DataGridView 隔行换色后再根据数据换色
- 4-MATLAB的矩阵运算
- 行业软件租赁服务,为服饰企业提供更经济的选择
- iOS开发-通过 objc_setAssociatedObject alert 和 button关联 及传值
- hdu 5380 Travel with candy(双端队列)
- HelloWorld
- win7中设置保护眼睛的绿豆沙色
- 5-求解线性方程组
- C#装箱拆箱 Nullable
- 6-使用MATLAB进行概率统计分析
- Android 开发中 如何将xml文件封装成对象,存放到数组中?
- 9.10扩展性与存储限制(一)——对于超大型的社交网站,展示两个人之间的“连接关系”或“社交路径”
- [bfs]AOJ 0558 Cheese