Subsequence(虫子法)
来源:互联网 发布:金牛物流软件 编辑:程序博客网 时间:2024/04/27 21:38
Subsequence
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 12187 Accepted: 5096
Description
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (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.
Input
The first line is the number of test cases. For each test case the program has to read the numbers N and S, separated by an interval, from the 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.
Output
For each the case the program has to print the result on separate line of the output file.if no answer, print 0.
Sample Input
210 155 1 3 5 10 7 4 9 2 85 111 2 3 4 5
Sample Output
23
Source
Southeastern Europe 2006
我的AC代码:O(n)
On<挑战>的代码:这是别人的思想欸, 挺有意思~O(nlogn)
我的AC代码:O(n)
#include <iostream>#include <cstdio>#include <vector>#include <map>#include <set>#include <string>#include <cstring>#include <cstdlib>#include <cmath>#include <utility>#include <algorithm>//#define LOCAusing namespace std;const int maxn = 1e5+50;int a[maxn];int main(){ #ifdef LOCA freopen("AAA.txt", "r", stdin); #endif // LOCA int t, n, sum, m, ans; cin >> t; while (t--) { ans = maxn; memset(a, 0, sizeof(a)); cin >> n >> m; for (int i=0; i<n; i++) { cin >> a[i]; } sum = a[0]; int first = 1; int last = 0; while (1) { if (sum < m && first < n) { sum += a[first++]; } while (sum >= m && last < n) { ans = min (ans, first-last); sum -= a[last++]; } if (last == n || (sum < m && first == n)) { break; } } if (ans == maxn) { cout << "0" << endl; } else { cout << ans << endl; } }return 0;}
On<挑战>的代码:这是别人的思想欸, 挺有意思~O(nlogn)
#include <iostream>#include <cstdio>#include <vector>#include <map>#include <set>#include <string>#include <cstring>#include <cstdlib>#include <cmath>#include <utility>#include <algorithm>using namespace std;const int maxn = 1e5+50;int sum[maxn], a[maxn];int t, n, S;void solve(){ for (int i=0; i<n; i++) { sum[i+1] = sum[i] + a[i]; } if (sum[n] < S) { cout << "0" << endl; return ; } int res = n; for (int s=0; sum[s]+S<=sum[n]; s++) { int t = lower_bound(sum+s, sum+n, sum[s]+S) - sum; res = min (res, t-s); } cout << res << endl;}int main(){ cin >> t; while (t--) { memset(a, 0, sizeof(a)); memset(sum, 0, sizeof(sum)); cin >> n >> S; for (int i=0; i<n; i++) { cin >> a[i]; } solve(); }return 0;}YUANLAI写完一道题后看看别人的思想也是一件很有意思的事情的说~~
0 0
- Subsequence(虫子法)
- 虫子妈妈
- 面包 & 虫子
- POJ3061 Subsequence (追逐法)
- Subsequence
- Subsequence
- Subsequence
- subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Subsequence
- Ubuntu 用vsftpd 配置FTP服务器
- 中容量STM32处理器启动代码的理解
- web集群时session同步的3种方法
- OPENCV入门教程三:cvtColor彩色图转灰度图
- 不依赖于第三方库的日期时间选择器插件--Rome
- Subsequence(虫子法)
- AES与RSA相结合数据加密方案
- win10的vs2012.NET Framework 4.0未注册的大坑
- Oracle数据库的CONNECT BY ROWNUM研究
- 判断二叉排序树是否相同
- Linphone探索:7 . 如何进行视频电话
- 归并排序算法
- 通过Application Context进行变量共享
- map集合