【Codeforces Round 364 (Div 2)C】【前缀和 双指针】They Are Everywhere 含有所有字符的最短区间长度
来源:互联网 发布:mac怎么调出所有应用 编辑:程序博客网 时间:2024/06/08 04:52
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.
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.
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.
3AaA
2
7bcAAcbc
3
6aaBCCe
5
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<stdio.h>#include<iostream>#include<string.h>#include<string>#include<ctype.h>#include<math.h>#include<set>#include<map>#include<vector>#include<queue>#include<bitset>#include<algorithm>#include<time.h>using namespace std;void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }#define MS(x,y) memset(x,y,sizeof(x))#define MC(x,y) memcpy(x,y,sizeof(x))#define MP(x,y) make_pair(x,y)#define ls o<<1#define rs o<<1|1typedef long long LL;typedef unsigned long long UL;typedef unsigned int UI;template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b>a)a = b; }template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b<a)a = b; }const int N = 1e5 + 10, M = 0, Z = 1e9 + 7, ms63 = 0x3f3f3f3f;int n;char s[N];int sum[N][128];bool e[128];int tot;int main(){while (~scanf("%d", &n)){scanf("%s", s + 1);for (int i = 1; i <= n; ++i){for (int j = 'A'; j <= 'z'; ++j)sum[i][j] = sum[i - 1][j];++sum[i][s[i]];tot += !e[s[i]];e[s[i]] = 1;}int ans = n;int r = 1;for (int l = 1; l <= n; ++l){while (r <= n){int num = 0;for (int i = 'A'; i <= 'z'; ++i){num += (sum[r][i] - sum[l - 1][i] > 0);}if (num == tot)break;else ++r;}if (r > n)break;else gmin(ans, r - l + 1);}printf("%d\n", ans);}return 0;}
- 【Codeforces Round 364 (Div 2)C】【前缀和 双指针】They Are Everywhere 含有所有字符的最短区间长度
- Codeforces Round #364 div.2 C. They Are Everywhere 【尺追法】
- Codeforces Round #364 (Div. 2) C. They Are Everywhere(二分)
- Codeforces Round #364 (Div. 2)C. They Are Everywhere
- Codeforces Round #364 (Div. 2) C. They Are Everywhere
- Codeforces Round #364 (Div. 2) C. They Are Everywhere (尺取法)
- Codeforces Round #364 (Div. 2) C They Are Everywhere(滑窗)
- Codeforces Round #364 (Div. 2) C. They Are Everywhere (窗口滑动)
- Codeforces Round #364 (Div. 2) C. They Are Everywhere(stl+乱搞)
- Codeforces Round #364 (Div. 2) C. They Are Everywhere (尺取法)
- Codeforces Round #364 (Div. 2) C. They Are Everywhere (尺取法)
- Codeforces Round #364 (Div. 2) C. They Are Everywhere __ two pointers or binary search
- Codeforces #364(Div.2)C.They Are Everywhere【思维】
- 【Codeforces Round 354 (Div 2)C】【前缀和二分or双指针】Vasya and String ab序列最多改变k位置的最长同字符子串长度
- CF #364 (Div. 2)(C. They Are Everywhere 尺取法)
- Codeforces Round #364 C. They Are Everywhere分析及题解 尺取法
- Codeforces 701C They Are Everywhere(尺取/双指针)
- div.2/C. They Are Everywhere<two pointer>
- win7 64位,PowerDesigner中导入MYSQL数据库结构的步骤及问题解决
- Leetcode 2. Add Two Numbers
- Android Studio代码检测和性能分析工具
- org.apache.catalina.deploy.WebXml addFilter
- poj3070 Fibonacci(矩阵快速幂)
- 【Codeforces Round 364 (Div 2)C】【前缀和 双指针】They Are Everywhere 含有所有字符的最短区间长度
- EEPROM和FLASH区别
- Hdu 3938 Portal((离线+并查集) (★)
- linux使用nfs、portmap服务共享远程磁盘的方法
- linux之cp/scp命令
- 关于Spring中ehcahce实现注解缓存的配置
- 为什么你应该(从现在开始就)写博客
- RESTful风格实现拦截登录
- 控制div属性