Submission #1360950

---

Source Code Expand

#include <bits/stdc++.h>
#define MAX 1000005
#define ll long long
#define upperlimit 1000100
#define INF 1e18
#define eps 1e-8
#define endl '\n'
#define pcc pair<char,char>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tr(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define MOD 1000000007
#define slld(t) scanf("%lld",&t)
#define sd(t) scanf("%d",&t)
#define pd(t) printf("%d\n",t)
#define plld(t) printf("%lld\n",t)
#define mp(a,b) make_pair(a,b)
#define FF first
#define SS second
#define pb(x) push_back(x)
#define vi vector<int>
#define vll vector<ll>
#define clr(a) memset(a,0,sizeof(a))
#define debug(a) printf("check%d\n",a)
#define csl ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
 
ll gcd(ll n1,ll n2){
	if(n2==0)
		return n1;
	if(n1%n2==0)return n2;
	return gcd(n2,n1%n2);
}
ll powmod(ll base,ll exponent)
{
	ll ans=1;
	while(exponent){
		if(exponent&1)ans=(ans*base)%MOD;
		base=(base*base)%MOD;
		exponent/=2;
	}
	return ans;
}
vector<int> xxx;
int main()
{
	string s;
	cin>>s;
	int ans=MOD;
	for(int i=0;i<26;i++)
	{
		char c='a'+i;
		xxx.pb(0);
		for(int j=0;j<s.length();j++)
		{
			if(s[j]==c)
			{
				xxx.pb(j+1);
				//cout<<j+1<<endl;
			}
		}
		int l=s.length();
		xxx.pb(l+1);
		int now=0;
		for(int j=1;j<xxx.size();j++)
		{
			//if(c=='r')
			//	cout<<xxx[j]<<endl;
			now=max(now,xxx[j]-xxx[j-1]-1);
		}
		//cout<<endl;
		xxx.clear();
		ans=min(ans,now);
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result