Submission #1363755


Source Code Expand

#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<algorithm>
#include<cmath>
#include<climits>
#include<string>
#include<set>
#include<numeric>
#include<map>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;
typedef pair<ll, ll> mp;

//a-zの26通りやる。

int main(void){
	string s,alphabet="abcdefghijklmnopqrstuvwxyz",a,b;
	int before=-1,dist=0,ans=99999999;
	cin>>s;
	rep(i,26){
		a = alphabet[i];
		dist = 0;
		before = -1;
		rep(j,s.size()){
			b = s[j];
			if(a==b){
				if(before==-1){
					dist = j;
					// cout<<"最初"<<j<<","<<a<<dist<<endl;
				}else if(dist<j - before - 1){
					dist = j - before - 1;
					// cout<<"途中"<<j<<","<<a<<dist<<endl;
				}
				before = j;//到達したら問答無用で到達フラグ
			}
		}
		if(before==-1){
			dist = s.size();
		}else if(dist<s.size()-1-before){
			dist = s.size()-1-before;
		}
		if(ans>dist)ans = dist;
	}
	
	cout<<ans<<endl;
	return 0;
}

Submission Info

Submission Time
Task A - Shrinking
User RMQ
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1233 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 14
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
0_02.txt AC 1 ms 256 KB
0_03.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 1 ms 256 KB
1_04.txt AC 1 ms 256 KB
1_05.txt AC 1 ms 256 KB
1_06.txt AC 1 ms 256 KB
1_07.txt AC 1 ms 256 KB
1_08.txt AC 1 ms 256 KB
1_09.txt AC 1 ms 256 KB