zoukankan      html  css  js  c++  java
  • POJ 3320

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

    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

     
    尺取法求解
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <algorithm>
     5 #include <map>
     6 
     7 using namespace std;
     8 
     9 #define maxn 1000005
    10 
    11 int p,len = 0;
    12 int a[maxn];
    13 map<int,int> ele;
    14 
    15 void solve() {
    16         map<int,int> vis;
    17         int s = 1,sum = 0,pos = 1;
    18         int ans = p;
    19 
    20         for(; ; ++s) {
    21                 while(sum < len && pos <= p) {
    22                         if(vis.find(a[pos]) == vis.end() || vis[ a[pos] ] == 0) {
    23                                 ++sum;
    24                         }
    25                         ++vis[ a[pos++] ];
    26                 }
    27 
    28                 if(sum < len) break;
    29                 if(--vis[ a[s] ] == 0) {
    30                         --sum;
    31                 }
    32                 ans = min(ans,pos - s);
    33         }
    34 
    35         printf("%d
    ",ans);
    36 }
    37 
    38 int main()
    39 {
    40    // freopen("sw.in","r",stdin);
    41 
    42     scanf("%d",&p);
    43     for(int i = 1; i <= p; ++i) {
    44             scanf("%d",&a[i]);
    45             if(ele.find(a[i]) == ele.end()) {
    46                     ele[ a[i] ] = len++;
    47             }
    48     }
    49     //printf("len = %d
    ",len);
    50 
    51     solve();
    52     return 0;
    53 }
    View Code
  • 相关阅读:
    linux -- 基于zookeeper搭建yarn的HA高可用集群
    Linux -- 之HDFS实现自动切换HA(全新HDFS)
    Hadoop格式化 From hu-hadoop1/192.168.11.11 to hu-hadoop2:8485 failed on connection exception: java.net.
    Directory /home/hdfs/name is in an inconsistent state: storage directory does not exist or is not a
    react学习01
    单页面应用(spa)引入百度地图(Cannot read property 'dc' of undefined)
    npm 发布包
    Vue学习-01
    echarts3.0使用总结
    webpack学习--创建一个webpack打包流程
  • 原文地址:https://www.cnblogs.com/hyxsolitude/p/3623364.html
Copyright © 2011-2022 走看看