#include<iostream>
#include<algorithm>
#define M 2000001
using namespace std;
char hway[M];
int minDist();
int main()
{
int l,d;
//freopen("in.txt","r",stdin);
while(scanf("%d\n",&l)&&l)
{
gets(hway);
d=minDist();
printf("%d\n",d);
}
return 0;
}
int minDist()
{
int i,j,k,l,st,end,dist=2000000;
for(l=0;hway[l];l++)
{
if(hway[l]=='Z')
return 0;
}
for(i=0;hway[i];i++)
if(hway[i]^'.')
{
st=i;
break;
}
for(i=st;hway[i];i++)
{
if(hway[i]^'.')
{
if((hway[st]^hway[i])&&(i-st<dist))
dist=i-st;
st=i;
}
}
return dist;
}
No comments:
Post a Comment
Note: Only a member of this blog may post a comment.