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

    http://poj.org/problem?id=3320

    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

    代码:

    #include <iostream>
    #include <stdio.h>
    #include <string.h>
    #include <set>
    #include <map>
    using namespace std;
    
    const int maxn = 1e5 + 10;
    int P;
    int a[maxn];
    
    void solve() {
        set<int> all;
        for(int i = 0; i < P; i ++)
            all.insert(a[i]);
        int n = all.size();
    
        int s = 0, t = 0, num = 0;
        map<int, int> mp;
        int res = P;
        for(; ;) {
            while(t < P && num < n) {
                if(mp[a[t ++]] ++ == 0)
                    num ++;
            }
    
            if(num <n) break;
            res = min(res, t - s);
            if(-- mp[a[s ++]] == 0)
                num --;
        }
        printf("%d
    ", res);
    }
    
    int main() {
        scanf("%d", &P);
        for(int i = 0; i <P; i ++)
            scanf("%d", &a[i]);
        solve();
        return 0;
    }
    

      

  • 相关阅读:
    flask数据库
    python 百万级别类实例实现节省内存
    python定义一种新类型的元组
    python使用临时文件
    open函数 文件设置缓冲
    词频统计,字典成绩排序
    列表数组集合解析
    2019蓝桥杯Java第十题大学生B组——最短路径思想
    项目企业信息图谱分析有感——数据分析
    需求分析有感
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9769099.html
Copyright © 2011-2022 走看看