POJ 3320 Jessica's Reading Problem

最新推荐文章于 2024-02-16 17:44:03 发布

原创最新推荐文章于 2024-02-16 17:44:03 发布 · 129 阅读

0 ·

CC 4.0 BY-SA版权

尺取专栏收录该内容

2 篇文章

订阅专栏

本文介绍了一种算法，用于解决求解包含所有知识点的最短连续书页数量问题。通过使用set和map数据结构，算法能有效地找出课本中覆盖所有必要知识点的最短连续部分，帮助学生高效复习。

题目
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;
}