zoukankan      html  css  js  c++  java
  • codeforces #364c They Are Everywhere 尺取法

    C. They Are Everywhere
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Sergei B., the young coach of Pokemons, has found the big house which consists of n flats ordered in a row from left to right. It is possible to enter each flat from the street. It is possible to go out from each flat. Also, each flat is connected with the flat to the left and the flat to the right. Flat number 1 is only connected with the flat number 2 and the flat number n is only connected with the flat number n - 1.

    There is exactly one Pokemon of some type in each of these flats. Sergei B. asked residents of the house to let him enter their flats in order to catch Pokemons. After consulting the residents of the house decided to let Sergei B. enter one flat from the street, visit several flats and then go out from some flat. But they won't let him visit the same flat more than once.

    Sergei B. was very pleased, and now he wants to visit as few flats as possible in order to collect Pokemons of all types that appear in this house. Your task is to help him and determine this minimum number of flats he has to visit.

    Input

    The first line contains the integer n (1 ≤ n ≤ 100 000) — the number of flats in the house.

    The second line contains the row s with the length n, it consists of uppercase and lowercase letters of English alphabet, the i-th letter equals the type of Pokemon, which is in the flat number i.

    Output

    Print the minimum number of flats which Sergei B. should visit in order to catch Pokemons of all types which there are in the house.

    Examples
    input
    3
    AaA
    output
    2
    input
    7
    bcAAcbc
    output
    3
    input
    6
    aaBCCe
    output
    5
    Note

    In the first test Sergei B. can begin, for example, from the flat number 1 and end in the flat number 2.

    In the second test Sergei B. can begin, for example, from the flat number 4 and end in the flat number 6.

    In the third test Sergei B. must begin from the flat number 2 and end in the flat number 6..

    读题,就是一道尺取法的题,取最短的尺。

    #include<iostream>
    #include<map>
    #include<set>
    #include<stdio.h>
    #include<string>
    #include<string.h>
    #include<cstring>
    using namespace std;
    const int maxx = 100005;
    int main(){
        int n;
        scanf("%d",&n);
        char s[maxx];
        scanf("%s",s);
        set<int>pok;
        int poks[maxx];
        map<int,int>have;
        for(int i=0;i<n;i++){
            poks[i]=s[i]-'A';
            pok.insert(poks[i]);
        }
        int kind=pok.size();
        int sta=0;
        int end=0;
        int num=0;
        int ans=0x7fffffff;
        while(1){
            while(end<n&&num<kind){
                if(have[poks[end]]==0){
                    num++;
                    have[poks[end]]++;
                    end++;
                }else{
                    have[poks[end]]++;
                    end++;
                }
            }
            if(num<kind) break;
    
            ans=min(ans,end-sta);
            have[poks[sta]]--;
            if(have[poks[sta]]==0) num--;
            sta++;
        
        }
        printf("%d
    ",ans);
        return 0;
    }
    View Code
  • 相关阅读:
    由优化反射性能问题引发的思考
    Flash还能走多远?
    .net CLR 4.0垃圾回收机制的改进之3
    Silverlight 3引入了GPU加速的特性
    java 字符串
    JAVA 容器
    JAVA 反转链表
    JAVA 自定义比较器
    JAVA 类相关知识
    vscode 输出中文乱码
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5698836.html
Copyright © 2011-2022 走看看