zoukankan      html  css  js  c++  java
  • POJ 3320 Jessica's Reading Problem

    Jessica's Reading Problem
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 10568   Accepted: 3529

    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

    Source

     
     
     
    解析:尺取法
     
    #include <cstdio>
    #include <set>
    #include <map>
    #include <algorithm>
    using namespace std;
    
    const int MAXN = 1000000+5;
    int p;
    int a[MAXN];
    
    void solve()
    {
        set<int> s;
        for(int i = 0; i < p; ++i)
            s.insert(a[i]);
        int n = s.size();
        map<int, int> mp;   //存储知识点的出现次数
        //尺取法
        int l = 0, r = 0;   //初始化左右指针
        int num = 0, res = 0x7fffffff;
        while(1){
            while(r < p && num < n){    //不断移动右指针,直到满足条件
                if(mp[a[r++]]++ == 0){
                    ++num;
                }
            }
            if(num < n) //条件无法满足,终止
                break;
            res = min(res, r-l);    //更新结果,相应区间为[l, r)
            if(--mp[a[l++]] == 0){  //移动左指针
                --num;
            }
        }
        printf("%d
    ", res);
    }
    
    int main()
    {
        scanf("%d", &p);
        for(int i = 0; i < p; ++i)
            scanf("%d", &a[i]);
        solve();
        return 0;
    }
    

      

  • 相关阅读:
    linux
    【转】三种地理参考信息模型:WMS,WFS,WCS
    Flex工程与Asp.net工程集成发布时若干注意事项
    招聘Asp.NET高级开发人员
    【转】2008'中国地理信息系统优秀工程公示
    推荐一本GIS的好书《空间数据库》
    集中推荐一些Map Projection方面资源
    收藏几篇虚拟化的文章
    征集“地图制图”WEB站点、BBS
    [转]NHibernate文章转载
  • 原文地址:https://www.cnblogs.com/inmoonlight/p/5749530.html
Copyright © 2011-2022 走看看