• poj 3320 Jessica's Reading Problem 尺取法


    Jessica's Reading Problem

    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<iostream>
    #include<cstdio>
    #include<cmath>
    #include<string>
    #include<queue>
    #include<algorithm>
    #include<stack>
    #include<cstring>
    #include<vector>
    #include<list>
    #include<set>
    #include<map>
    using namespace std;
    #define ll __int64
    #define mod 1000000007
    #define inf 999999999
    //#pragma comment(linker, "/STACK:102400000,102400000")
    int scan()
    {
        int res = 0 , ch ;
        while( !( ( ch = getchar() ) >= '0' && ch <= '9' ) )
        {
            if( ch == EOF ) return 1 << 30 ;
        }
        res = ch - '0' ;
        while( ( ch = getchar() ) >= '0' && ch <= '9' )
            res = res * 10 + ( ch - '0' ) ;
        return res ;
    }
    int a[1000010];
    set<int>s;
    map<int,int>m;
    int main()
    {
        int x,y,z,i,t;
        while(~scanf("%d",&x))
        {
            s.clear();
            m.clear();
            for(i=0;i<x;i++)
            {
                scanf("%d",&a[i]);
                s.insert(a[i]);
            }
            y=s.size();
            int st=0,ji=0,en=0,minn=10000010;
            while(1)
            {
                while(en<x&&ji<y)
                {
                    if(m[a[en]]==0)
                    ji++;
                    m[a[en]]++;
                    en++;
                }
                //cout<<st<<" "<<en<<" "<<ji<<"~~~"<<endl;
                if(ji<y)break;
                if(en-st<minn)
                minn=en-st;
                m[a[st]]--;
                if(m[a[st]]==0)
                ji--;
                st++;
            }
            printf("%d
    ",minn);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    配置双jdk
    检测一个页面所用的时间的js
    java发送短信开发,第三方接口方法
    jq的常用事件及其案例
    ajax无法返回视图
    SpringMVC IO 文件上传
    及上一篇linux安装mysql的说明
    centos6.10下安装mysql8.0.16root密码修改的坑
    线程池学习
    数组的分隔
  • 原文地址:https://www.cnblogs.com/jhz033/p/5447455.html
Copyright © 2020-2023  润新知