zoukankan      html  css  js  c++  java
  • Codeforces Round #364 (Div. 2) C.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 numbern - 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.

    题解:

    很裸的双指针

     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 #define F(i,a,b) for(int i=a;i<=b;++i)
     5 using namespace std;
     6 char a[100010];
     7 int vis[100];
     8 
     9 inline int getid(char x){
    10     if(x>='A'&&x<='Z')return x-'A';
    11     return x-'a'+30;
    12 }
    13 int main(){
    14     int n,all=0;
    15     scanf("%d",&n);
    16     scanf("%s",a+1);
    17     F(i,1,n)vis[getid(a[i])]=1;
    18     F(i,0,59)if(vis[i])all++;
    19     memset(vis,0,sizeof(vis));
    20     int l=1,r=0,cnt=0,ans=100000000;
    21     while(r<=n)
    22     {
    23         while(r<n&&cnt<all){
    24             r++;
    25             int idx=getid(a[r]);
    26             if(vis[idx]==0)cnt++;
    27             vis[idx]++;
    28         }
    29         if(r==n&&cnt<all)break;
    30         if(cnt==all){ans=min(ans,r-l+1);}
    31         while(cnt==all){
    32             int idx=getid(a[l]);
    33             vis[idx]--;
    34             if(vis[idx]==0)cnt--;
    35             l++;
    36             if(cnt==all)ans=min(ans,r-l+1);
    37         }
    38     }
    39     printf("%d
    ",ans);
    40     return 0;
    41 }
    View Code
  • 相关阅读:
    vs2010 setup 打包 安装 BAT批处理实现自动安装软件功能
    为什么我上传了flv或MP4文件到服务器,可输入正确地址通过http协议来访问总是出现“无法找到该页”的404错误呢
    异步编程:(TAP)基于任务的异步编程模型详解
    异步编程:IAsyncResult异步编程模型 (APM)
    WCF:调用方未由服务器进行身份验证
    django 操作数据库--orm(object relation mapping)---models
    python操作memcached以及分布式
    网络干货,无论是运维还是开发都要知道的网络知识系列之(七)
    一次完整的HTTP事务是怎样一个过程?
    网络干货,无论是运维还是开发都要知道的网络知识系列之(六)
  • 原文地址:https://www.cnblogs.com/bin-gege/p/5699089.html
Copyright © 2011-2022 走看看