[模拟]subsequence
2013-10-28 11:22
393 查看
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integerS (S <
100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.
first line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The input will finish with the end of file.
容易由单调性想到二分,但是本题的单调性可以继续优化算法。
对于给定i,若j-1,不满足sum[j-1]-sum[i-1] ≥S,则j,一定不满足sum[j]-sum[i-1]≥S,因此局部解区间由(1,n)缩小到(i,n),即(1,i-1)不需考虑。
100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum of which is greater than or equal to S.
Input
Many test cases will be given. For each test case the program has to read the numbers N and S, separated by an interval, from thefirst line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The input will finish with the end of file.
Output
For each the case the program has to print the result on separate line of the output file. If there isn't such a subsequence, print 0 on a line by itself.Sample Input
10 15 5 1 3 5 10 7 4 9 2 8 5 11 1 2 3 4 5
Sample Output
2 3
容易由单调性想到二分,但是本题的单调性可以继续优化算法。
对于给定i,若j-1,不满足sum[j-1]-sum[i-1] ≥S,则j,一定不满足sum[j]-sum[i-1]≥S,因此局部解区间由(1,n)缩小到(i,n),即(1,i-1)不需考虑。
#include <cstdio> int ans = 0x3f3f3f3f; int min(int a,int b) { if (a < b) return a; return b; } int sum[100010]; int main() { freopen("subsequence.in","r",stdin); freopen("subsequence.out","w",stdout); int n,s; while (scanf("%d%d",&n,&s) == 2) { ans = 0x3f3f3f3f; for (int i=1;i<=n;i++) { int num; scanf("%d",&num); sum[i] = sum[i-1]+num; } int i = 1; for (int j=1;j<=n;j++) { if (sum[j] - sum[i-1] < s)continue; while(sum[j]-sum[i]>=s) i++; ans = min(ans,j-i+1); } if (ans == 0x3f3f3f3f) printf("0\n"); else printf("%d\n",ans); } return 0; }
相关文章推荐
- BZOJ.3638.CF172 k-Maximum Subsequence Sum(模拟费用流 线段树)
- 【BZOJ3638】Cf172 k-Maximum Subsequence Sum 线段树区间合并(模拟费用流)
- 《C#程序设计》模拟试题以及答案
- 分子模拟基础篇
- Geeksforgeeks面试题 - Longest Increasing Subsequence
- Python3 模拟MapReduce处理分析大数据文件——《Python宝典》
- 第7周项目5-排队看病模拟
- qemu模拟执行固件文件
- 300. Longest Increasing Subsequence
- 用Fiddler模拟低速网络环境
- JZOJ5347【NOIP2017提高A组模拟9.5】遥远的金字塔 斜率优化 DP
- 利用 tcpcopy 引流做模拟在线测试
- C#模拟Post和Get方式发送数据
- 【模拟退火】 poj1379 Run Away
- asp.net后台用HttpWebRequest模拟post提交
- 使用jQuery简单实现模拟浏览器搜索功能
- ATPDraw v5.7 1CD电力电路仿真模拟软件
- C语言模拟C++list
- python之selenium模拟登录知乎
- PMP题库-永久免费的在线PMP模拟考试系统-首页