HDU_5783_DivideTheSequence(贪心)
来源:互联网 发布:域名交易新闻 编辑:程序博客网 时间:2024/05/01 15:04
Divide the Sequence
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 637 Accepted Submission(s): 330
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 containsn integers A1,A2⋯An .
1≤n≤1e6
−10000≤A[i]≤10000
You can assume that there is at least one solution.
Each test case begin with an integer n in a single line.
The next line contains
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
61 2 3 4 5 641 2 -3 050 0 0 0 0
Sample Output
625
Author
ZSTU
Source
2016 Multi-University Training Contest 5
Recommend
wange2014
题意
题意每一个前缀和为非负的串可以划分成一个区间
问最多可以划分多少个区间
做法
反着扫
扫到非负了就加起来独自成为一个区间即可
保证了至少有一解,就少了很多特殊情况。
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;typedef long long LL;const int M=1e6+5;int nu[M];int main(){ int n; while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) scanf("%d",&nu[i]); int ans=0; LL sum=0; for(int i=n;i>=1;i--) { sum+=nu[i]; if(sum>=0) { ans++; sum=0; } else continue; } printf("%d\n",ans); } return 0;}
0 0
- HDU_5783_DivideTheSequence(贪心)
- 贪心(bnuoj49103+二分+贪心)
- 【贪心算法(一)】贪心算法基础
- zoj1002_FireNet(贪心法)
- 贪心题目(SOJ)
- POJ2718(枚举 + 贪心)
- POJ 1328(贪心)
- POJ 1818(贪心)
- POJ 1065(贪心)
- POJ 1477(贪心)
- Monster (贪心)
- 最优装载(贪心)
- 哈夫曼编码(贪心)
- hdu 2570 (贪心)
- uva 11389(贪心)
- poj 2054(贪心)
- Huffman 编码 (贪心)
- hdu 4647(贪心?!)
- Android layout布局属性、标签属性总结大全
- 24节气算法
- SSM框架搭建
- 【CDOJ】柱爷与咸鱼神功
- 什么是优秀的用户体验:解读40个优秀界面设计
- HDU_5783_DivideTheSequence(贪心)
- Android解压缩
- 文章标题
- 关于socket的认识理解
- android L 节电助手分享
- winform程序利用Log4net记录日志
- synchronized run()方法
- 怎么在github上使用pull request
- Flask web开发 视图函数响应