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

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

    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

     
    题意:有n页书涵盖所有知识点,求涵盖所有知识点的连续页总数的最小值
    思路:尺取法 用set、map、queue进行维护就好了哒~
    accode
    #include<iostream>
    #include<cstdio>
    #include<cstdlib>
    #include<sstream>
    #include<cstring>
    #include<string>
    #include<vector>
    #include<set>
    #include<stack>
    #include<queue>
    #include<map>
    #include<cmath>
    #include<algorithm>
    using namespace std;
    #define inf 0x3f3f3f3f
    #define ll long long
    #define MAX_N 1000005
    #define gcd(a,b) __gcd(a,b)
    #define mem(a,x) memset(a,x,sizeof(a))
    #define mid(a,b) a+b/2
    #define stol(a) atoi(a.c_str())//string to long
    int temp[MAX_N];
    int main(){
        //std::ios::sync_with_stdio(false);
        //std::cin.tie(0);
    //    #ifndef ONLINE_JUDGE
    //        freopen("D:\in.txt","r",stdin);
    //        freopen("D:\out.txt","w",stdout);
    //    #else
    //    #endif
        int n;
        queue<int> que;
        set<int> iset;
        map<int,int> imap;
        scanf("%d",&n);
        for(int i = 0; i < n; i++){
            scanf("%d",&temp[i]);
            iset.insert(temp[i]);
        }
        int k = iset.size();
        iset.clear();
        int res = inf;
        for(int i = 0; i < n; ++i){
            iset.insert(temp[i]);
            que.push(temp[i]);
            imap[temp[i]]++;
            if(iset.size() == k){
    //            printf("%d
    ",i);
                res = min(res,(int)que.size());
            }
            while(iset.size() == k){
                int a = que.front();
                imap[a]--;
                que.pop();
                if(imap[a]==0){
                    res = min(res,(int)que.size()+1);
                    iset.erase(a);
                }
    
            }
    
        }
        printf("%d
    ",res);
        return 0;
    }
  • 相关阅读:
    基于uds的bootloader开发中的意外情况
    TC275的overlay的使用示例-用于XCP标定
    react + antd Table实现表格数据合并
    vue-cli引入静态资源报错及引入方法
    react + antd form表单验证自定义验证validator根据后台接口判断验证
    react hook + antd upload 通过fileList控制文件列表展示status为uploading
    create react app创建的react项目+typescript配置项目根路径
    react hook+antd实现点击发送验证码功能
    react.js antd-table 可编辑表格验证
    ant-design-pro protable 树形表格默认展开
  • 原文地址:https://www.cnblogs.com/zhenggaoxiong/p/9848534.html
Copyright © 2011-2022 走看看