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

    Jessica's Reading Problem
    Time Limit: 1000ms, Memory Limit: 65536Kb

    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

     

    【题解】尺取法,其实就是“单调队列”。

    具体见《挑战程序设计竞赛(第2版)》P150

     

     1 #include<stdio.h>
     2 #include<map>
     3 #include<set>
     4 using namespace std;
     5 set<int> s;
     6 map<int,int> m;
     7 int num, a[1000001], n;
     8 int main() {
     9     while(~scanf("%d",&n)) {
    10         s.clear(); m.clear();
    11         for (int i=0;i<n;++i){
    12             scanf("%d",&a[i]);
    13             s.insert(a[i]);
    14         }
    15         num=s.size();    
    16         //set用来去重
    17         int s=0,t=0,ns=0,mx=n;
    18         for (;;) {
    19             while(t<n&&ns<num) 
    20                 if(m[a[t++]]++==0) ns++; 
    21             if(ns<num) break;
    22             mx=min(mx,t-s);
    23             if(--m[a[s++]]==0) ns--;
    24         } 
    25         printf("%d
    ",mx);
    26     }
    27     return 0;
    28 }
    View Code

     

     

  • 相关阅读:
    零碎
    Python学习 day03 (续day02)
    Python学习 day02
    Python学习 Day1
    线性表——顺序表
    纠删码简介
    小数转化为分数
    C语言多线程操作
    转载:RAMCloud
    转载:全球级分布式数据库Google Spanner
  • 原文地址:https://www.cnblogs.com/TonyNeal/p/poj3320.html
Copyright © 2011-2022 走看看