Educational Codeforces Round 33 D. Credit Card
Credit Card
time limit per test2 seconds
memory limit per test256 megabytes
Recenlty Luba got a credit card and started to use it. Let's consider n consecutive days Luba uses the card.
She starts with 0 money on her account.
In the evening of i-th day a transaction ai occurs. If ai > 0, then ai bourles are deposited to Luba's account. If ai < 0, then ai bourles are withdrawn. And if ai = 0, then the amount of money on Luba's account is checked.
In the morning of any of n days Luba can go to the bank and deposit any positive integer amount of burles to her account. But there is a limitation: the amount of money on the account can never exceed d.
It can happen that the amount of money goes greater than d by some transaction in the evening. In this case answer will be «-1».
Luba must not exceed this limit, and also she wants that every day her account is checked (the days when ai = 0) the amount of money on her account is non-negative. It takes a lot of time to go to the bank, so Luba wants to know the minimum number of days she needs to deposit some money to her account (if it is possible to meet all the requirements). Help her!
Input
The first line contains two integers n, d (1 ≤ n ≤ 105, 1 ≤ d ≤ 109) —the number of days and the money limitation.
The second line contains n integer numbers a1, a2, ... an ( - 104 ≤ ai ≤ 104), where ai represents the transaction in i-th day.
Output
Print -1 if Luba cannot deposit the money to her account in such a way that the requirements are met. Otherwise print the minimum number of days Luba has to deposit money.
Examples
inputCopy
5 10
-1 5 0 -5 3
outputCopy
0
inputCopy
3 4
-10 0 20
outputCopy
-1
inputCopy
5 10
-5 0 10 -11 0
outputCopy
2
找了一个写的比较好的中文题面QAQ。。。
有一张信用卡可以使用,每天白天都可以去给卡充钱。到了晚上,进入银行对卡的操作时间,操作有三种:
1.ai>0 银行会给卡充入ai元
2.ai<0 银行从卡中扣除ai元
3.ai=0 银行对你的卡进行评估,违背了规则就无权再使用此卡
规则1:卡内的余额不得超过d元
规则2:当ai=0时,卡内的余额不能是负数
现在问为了维持信用的平衡,最少去银行几次。(去一次,充一次钱)
反正看各种大神的算法感觉特别厉害。。。
我自己yy了一个乱七八糟的东西,运气好就1A了233
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, d, ans, a[maxn], b[maxn], c[maxn];
vector<int> lpl;
inline void check()
{
for(int i = 1; i <= n; ++i) printf("%d ", a[i]); printf("\n");
for(int i = 1; i <= n; ++i) printf("%d ", b[i]); printf("\n");
for(int i = 1; i <= n; ++i) printf("%d ", c[i]); printf("\n");
}
inline void prework()
{
int sum = 0;
for(int i = 1; i <= n; ++i){
if(a[i] == 0){
lpl.push_back(i);
if(sum < 0){b[i] = -sum; sum = 0;}
c[i] = sum;
continue;
}
sum += a[i]; if(sum > d){printf("-1"); exit(0);}
}
//check();
}
inline void workk()
{
ans = lpl.size();
for(int i = lpl.size() - 1; i >= 1; --i){
int now = lpl[i], pre = lpl[i - 1], sum = c[pre], mx = sum;
for(int j = pre + 1; j < now; ++j)
{sum += a[j]; mx = max(mx, sum);}
if(mx + b[now] <= d){ans--; b[pre] += b[now];}
}
if(b[1] == 0) ans--; cout << ans;
}
int main()
{
scanf("%d%d", &n, &d); n++; a[1] = 0;
for(int i = 2; i <= n; ++i) scanf("%d", &a[i]);
prework(); workk();
return 0;
}
Educational Codeforces Round 33 D. Credit Card的更多相关文章
- Educational Codeforces Round 33 (Rated for Div. 2) D. Credit Card
D. Credit Card time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu ...
- Educational Codeforces Round 33
# Who = Penalty * A B C D E F 479 arkethos 4 247 + 00:08 + 00:19 +1 00:59 +2 01:41 479 ne-leo ...
- Educational Codeforces Round 33 (Rated for Div. 2) D题 【贪心:前缀和+后缀最值好题】
D. Credit Card Recenlty Luba got a credit card and started to use it. Let's consider n consecutive d ...
- 【Educational Codeforces Round 33 D】Credit Card
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 每次遇到0的时候,看看当前累计的delta是多少. 如果大于0,则temp = d-delta; 小于0,取temp2 = min( ...
- Educational Codeforces Round 33 (Rated for Div. 2) E. Counting Arrays
题目链接 题意:给你两个数x,yx,yx,y,让你构造一些长为yyy的数列,让这个数列的累乘为xxx,输出方案数. 思路:考虑对xxx进行质因数分解,设某个质因子PiP_iPi的的幂为kkk,则这个 ...
- Educational Codeforces Round 33 (Rated for Div. 2) F. Subtree Minimum Query(主席树合并)
题意 给定一棵 \(n\) 个点的带点权树,以 \(1\) 为根, \(m\) 次询问,每次询问给出两个值 \(p, k\) ,求以下值: \(p\) 的子树中距离 \(p \le k\) 的所有点权 ...
- Educational Codeforces Round 33 (Rated for Div. 2) 题解
A.每个状态只有一种后续转移,判断每次转移是否都合法即可. #include <iostream> #include <cstdio> using namespace std; ...
- Educational Codeforces Round 33 (Rated for Div. 2)A-F
总的来说这套题还是很不错的,让我对主席树有了更深的了解 A:水题,模拟即可 #include<bits/stdc++.h> #define fi first #define se seco ...
- Educational Codeforces Round 33 (Rated for Div. 2) C. Rumor【并查集+贪心/维护集合最小值】
C. Rumor time limit per test 2 seconds memory limit per test 256 megabytes input standard input outp ...
随机推荐
- rpm - RPM 软件包管理器
SYNOPSIS 查询和校验软件包: rpm {-q|--query} [select-options] [query-options] rpm {-V|--verify} [select-optio ...
- win10 护眼
- HTML知识梳理(笔记)
HTML常见元素 meta 定义和用法<meta> 元素可提供有关页面的元信息(meta-information),比如针对搜索引擎和更新频度的描述和关键词. <meta> 标 ...
- LOJ6435 PKUSC2018 星际穿越
这个题吧当时在考场只得了45分 然后70分的性质都分析到了 不知道为啥就是写萎蛋了 哎 当时还是too young too simple 看了一下julao们的博客这个题有两种做法 一个是比较费脑子的 ...
- 大数据之hadoop框架知识
https://blog.csdn.net/zytbft/article/details/79285500
- python基础知识1
1.何为json? json 是一种轻量级的数据交换格式,采用完全独立于编程语言的文本格式来存储和表示数据.简洁和清晰的层次结构使得 JSON 成为理想的数据交换语言. 易于人阅读和编写,同时也易于机 ...
- Ubuntu下使用天河注意事项
把下载的.cgi登陆文件用文本编辑器打开,修改端口 用管理员权限打开.cgi才能绑定端口 $ gksu nautilus # browse files as root $ gksu gedit /et ...
- 【Java】maven打包源码、依赖插件
<plugins> <plugin> <groupId>org.springframework.boot</groupId> <artifactI ...
- css 图片 和 文本 的处理
图片 1.css3已经可以实现 img标签 和 img内图片分开处理的功能了.类似标签的背景图. https://www.zhangxinxu.com/wordpress/2015/03/css3 ...
- Scribd每月共有超过两亿个访客、累积数亿篇以上的文件档案,Alexa全球排名200以内
目前已登上世界300大网站,每月共有超过两亿个访客.累积数亿篇以上的文件档案.透过Flash介面的阅读器-iPaper,使用者可以在网站内浏览各种文件,由于该网站是一个文件分享平台,所有的文件都是由使 ...