POJ 3320 Jessica's Reading Problem

题目
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 <stdio.h>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
int page[1000010],vis[1000010]={0};
set<int> s;
int main()
{int l=0,r=0,p,num=0,sum=0,len=1000010;  //因为要求最小长度，所以令初始长度最大scanf("%d",&p);for(int i=0;i<p;i++){scanf("%d",&page[i]);s.insert(page[i]);}num=s.size();  //set插入时不会插入重复数字，所以set的大小就是知识点的个数map<int,int> c;  //记录每个知识点的个数for(;;){while(r<p&&sum<num)if(c[page[r++]]++==0)  //先判断这一页的知识点是否出现过再自增sum++;if(sum<num) break;  //跳出while循环一定是不满足其中一个条件，而这条if语句中sum<num，所以r>=p，所有页数都已经遍历过，跳出循环len=min(len,r-l);if(--c[page[l++]]==0)  //去掉最左边的知识点，左边界右移（如果这个知识点在当前区间中只出现过一次，sum--）sum--;        }printf("%d\n",len);return 0;
}

POJ 3320 Jessica's Reading Problem相关推荐

尺取法 POJ 3320 Jessica's Reading Problem
题目传送门 1 /* 2 尺取法:先求出不同知识点的总个数tot,然后以获得知识点的个数作为界限, 更新最小值 3 */ 4 #include <cstdio> 5 #include &l ...
POJ 3320 Jessica's Reading Problem (尺取)
Description 给出一段长度为\(n\)的整数序列,求包含所有出现过的数的连续区间的最小长度. Input 第一行给出序列长度\(n\),第二行给出\(n\)个整数,表示这个序列.\(n \l ...
POJ3320 Jessica's Reading Problem 尺取法
Jessica's Reading Problem. Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 22716 Accepted ...
Jessica‘s Reading Problem（尺取法）
Jessica's Reading Problem (尺取法) Jessica's a very lovely girl wooed by lots of boys. Recently she has ...
【POJ - 3320 】Jessica's Reading Problem （尺取，哈希）
题干: Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam i ...
Jessica's Reading Problem
第一部分:题目 Description Jessica's a very lovely girl wooed by lots of boys. Recently she has a problem. ...
POJ 3320 尺取法，Hash，map标记
1.POJ 3320 2.链接:http://poj.org/problem?id=3320 3.总结:尺取法,Hash,map标记看书复习,p页书,一页有一个知识点,连续看求最少多少页看完所有知识 ...
POJ 1207 The 3n + 1 problem
题目链接:http://poj.org/problem?id=1207 题目大意:给你一个数x,规定一个函数F(x),如果x为1则F(x)==1,否则如果x是偶数,F(x)==F(x/2),x为奇数F ...
poj 1681 Painter#39;s Problem(高斯消元)
http://poj.org/problem? id=1681 求最少经过的步数使得输入的矩阵全变为y. 思路:高斯消元求出自由变元.然后枚举自由变元,求出最优值. 注意依据自由变元求其它解及求最优值 ...

POJ 3320 Jessica's Reading Problem

POJ 3320 Jessica's Reading Problem相关推荐

最新文章

热门文章