La2678
来源:互联网 发布:抽数字软件在线 编辑:程序博客网 时间:2024/05/22 00:57
#include<cstdio>#include<cstdlib>#include<cstring>#include<cmath>#include<iostream>#include<algorithm>using namespace std;#define INF 0x7f7f7f7f#define MAXN (100000+5)int read[MAXN], pre[MAXN];int main(){int n, s;while(scanf("%d%d", &n, &s) != EOF){pre[0] = 0;for(int i = 1; i <= n; i++){ scanf("%d", &read[i]);pre[i] = pre[i-1]+read[i];}int i = 1, ans = INF;for(int j = 1; j <= n; j++){if(pre[i-1] > pre[j]-s) continue;while(pre[i] <= pre[j]-s) i++;ans = min(ans, j-i+1);}if(ans != INF) printf("%d\n", ans);else printf("0\n");}return 0;}
1 0
- LA2678
- La2678
- 尺取法+LA2678
- UvaLive LA2678 Subsequence
- LA2678最短子序列
- LA2678 Subsequence 时间优化
- LA2678 Subsequence 时间优化
- la2678(前缀和,二分/尺取法)
- LA2678 - Subsequence(求序列中长度最短的和>=S的子序列长度)
- mvc中模型对象中的元数据校验库
- Linux 下 Mysql 5.7 的安装
- 无重边无向连通图的割点和桥
- CoreAnimation
- hadoop safemode 的设置
- La2678
- 无重边有向连通图的强连通分量
- HashMap与ConcurrentHashMap的区别
- 扯扯淡
- C#使用SqlBulkCopy批量更新数据
- 3】Hanoi汉诺塔问题
- java引用webRoot下的文件
- 【Hibernate】——悲观锁和乐观锁
- Java日期转换SimpleDateFormat格式大全