HDU 5783 Divide the Sequence 2016 Multi-University Training Contest 5
来源:互联网 发布:网络在线教育平台 编辑:程序博客网 时间:2024/06/01 13:42
Divide the Sequence
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2232 Accepted Submission(s): 628
Problem Description
Alice has a sequence A, She wants to split A into as much as possible continuous subsequences, satisfying that for each subsequence, every its prefix sum is not small than 0.
Input
The input consists of multiple test cases.
Each test case begin with an integer n in a single line.
The next line contains n integers A1,A2⋯An.
1≤n≤1e6
−10000≤A[i]≤10000
You can assume that there is at least one solution.
Output
For each test case, output an integer indicates the maximum number of sequence division.
Sample Input
6
1 2 3 4 5 6
4
1 2 -3 0
5
0 0 0 0 0
Sample Output
6
2
5
给出一个串问最多可以分割成几个任意前缀和是>=0的子串。
补多校题。发现这不是大水题吗从后往前倒着贪心一下维护sum就好了。。为什么过得比最后一题还少。。。这代码才几行
#include <cstdio>#include <iostream>#include <string.h>#include <algorithm>using namespace std;#define MAX 1000005long long num[MAX];int main(){ int n; while(~scanf("%d",&n)) { for(int i=1;i<=n;i++) scanf("%lld",&num[i]); long long ans=0,sum=0; for(int i=n;i>=1;i--) { if(sum+num[i]>=0) { ans++; sum=0; } else { sum+=num[i]; } } printf("%lld\n",ans); }}
- HDU 5783 Divide the Sequence 2016 Multi-University Training Contest 5
- hdu 5783 Divide the Sequence(2016 Multi-University Training Contest 5——水题)
- 2016 多校 Multi-University Training Contest 5 Divide the Sequence
- 2016 Multi-University Training Contest 5 1003 Divide the Sequence
- 2016 Multi-University Training Contest 5 1003 Divide the Sequence (贪心)
- HDU5783 - Divide the Sequence(2016 Multi-University Training Contest 5 - C)
- hdu 4915 Parenthese sequence--2014 Multi-University Training Contest 5
- 2015 Multi-University Training Contest 1 Hdu 5297 Y sequence
- hdu 6047 Maximum Sequence(2017 Multi-University Training Contest
- hdu 5791 2016 Multi-University Training Contest 5(dp)
- HDU 5785 Interesting 2016 Multi-University Training Contest 5(Manacher)
- hdu 5860 Death Sequence(2016 Multi-University Training Contest 10——递推)
- hdu 5828 2016 Multi-University Training Contest 8 Rikka with Sequence 解题报告
- 2016 Multi-University Training Contest 5 题解
- 2016 Multi-University Training Contest 5
- 2016 Multi-University Training Contest 5
- 2016 Multi-University Training Contest 5
- hdu4915 Parenthese sequence 2014 Multi-University Training Contest 5
- 压缩感知重构算法之Gradient Descent with Sparsification(GraDeS)
- HDU1233还是畅通工程(最小生成树)
- 计算几何模板
- linux命令记录
- Solr4.6.1配置与建立索引——搜索引擎学习(一)
- HDU 5783 Divide the Sequence 2016 Multi-University Training Contest 5
- objective-c之错误处理
- Git的pull、add、commit、push、clone
- 收到推送通知后页面跳转,当程序在后台,无论进入后台之前在哪个界面,点击收到的推送,跳转到指定界面的2个思路:
- android 服务的应用,在Activity中实现背景音乐播放(转自http://blog.csdn.net/imyang2007/article/details/7597040,仅供个人学习)
- Customize export files in SSRS
- Cocos Creator 动作列表(摘自官方文档)
- Class.getSimpleName()的作用
- 记一个合并代码导致的错误(自定义控件路径改变引起找不到类)