###### 尺取法

Subsequence
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19253 Accepted: 8220

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

2
10 15
5 1 3 5 10 7 4 9 2 8
5 11
1 2 3 4 5

Sample Output

2
3

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
int n,s,t,arr[100001];
int main()
{
scanf("%d",&t);
while(t)
{
scanf("%d%d",&n,&s);
for(int i = 1;i <= n;++i)
scanf("%d",&arr[i]);
int j = 1,sum = 0,ans = INT_MAX;
for(int i = 1;i <= n;++i)
{
sum += arr[i];
while(sum >= s)
{
ans = min(ans,i - j + 1);
sum -= arr[j];
++j;
}
}
if(ans == INT_MAX)
printf("%d\n",0);
else
printf("%d\n",ans);
--t;
}
return 0;
}
Jessica's Reading Problem
 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15420 Accepted: 5312

Description

Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master all ideas included in a very thick text book. The author of that text book, like other authors, is extremely fussy about the ideas, thus some ideas are covered more than once. Jessica think if she managed to read each idea at least once, she can pass the exam. She decides to read only one contiguous part of the book which contains all ideas covered by the entire book. And of course, the sub-book should be as thin as possible.

A very hard-working boy had manually indexed for her each page of Jessica's text-book with what idea each page is about and thus made a big progress for his courtship. Here you come in to save your skin: given the index, help Jessica decide which contiguous part she should read. For convenience, each idea has been coded with an ID, which is a non-negative integer.

Input

The first line of input is an integer P (1 ≤ P ≤ 1000000), which is the number of pages of Jessica's text-book. The second line contains P non-negative integers describing what idea each page is about. The first integer is what the first page is about, the second integer is what the second page is about, and so on. You may assume all integers that appear can fit well in the signed 32-bit integer type.

Output

Output one line: the number of pages of the shortest contiguous part of the book which contains all ideals covered in the book.

Sample Input

5
1 8 8 8 1


Sample Output

2

#include<map>
#include<set>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include<iostream>
using namespace std;
int p,arr[1000001];
set<int> s;
map<int,int> m;
int main()
{
scanf("%d",&p);
for(int i = 1;i <= p;++i)
{
scanf("%d",&arr[i]);
s.insert(arr[i]);
}
int sum = s.size(),num = 0,j = 1,ans = INT_MAX;
for(int i = 1;i <= p;++i)
{
int temp = m[arr[i]];
if(!temp)
++num;
m[arr[i]] = ++temp;
while(num == sum)
{
ans = min(ans,i - j + 1);
int temp2 = m[arr[j]];
m[arr[j]] = --temp2;
if(!temp2)
--num;
++j;
}
}
printf("%d\n",ans);
return 0;
}

#### 算法学习之尺取法

2016-07-31 16:56:25

#### HDOJ 5806 尺取法

2016-08-12 23:43:10

#### 【模板】尺取法

2016-11-15 23:03:20

#### ACM常用的解题技巧：尺取法

2016-08-28 22:34:49

#### 【尺取法】

2016-08-19 18:02:10

#### POJ 3276 Face The Right Way （常用技巧-尺取法）

2015-08-26 16:37:39

#### POJ 3320 Jessica's Reading Problem (尺取法_滑动窗口，阅读最少页数)

2015-09-26 10:31:25

#### 算法--尺取法

2016-03-10 11:00:25

#### CF #364 (Div. 2)(C. They Are Everywhere 尺取法)

2016-07-28 09:11:28

#### POJ 2566（尺取法+前缀和排序）

2016-10-25 08:30:47