zoukankan      html  css  js  c++  java
  • Friendship of Frog(水题)

    Friendship of Frog

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 135    Accepted Submission(s): 106

    Problem Description
    N frogs from different countries are standing in a line. Each country is represented by a lowercase letter. The distance between adjacent frogs (e.g. the 1st and the 2nd frog, the N1th and the Nth frog, etc) are exactly 1. Two frogs are friends if they come from the same country. The closest friends are a pair of friends with the minimum distance. Help us find that distance.
     
    Input
    First line contains an integer T, which indicates the number of test cases. Every test case only contains a string with length N, and the ith character of the string indicates the country of ith frogs. 1T50. for 80% data, 1N100. for 100% data, 1N1000. the string only contains lowercase letters.
     
    Output
    For every test case, you should output "Case #x: y", where x indicates the case number and counts from 1 and y is the result. If there are no frogs in same country, output 1instead.
     
    Sample Input
    2 abcecba abc
     
    Sample Output
    Case #1: 2 Case #2: -1

    题解:水。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。

    代码:

    #include<iostream>
    #include<cstdio>
    #include<cmath>
    #include<cstring>
    #include<queue>
    #include<algorithm>
    #include<vector>
    using namespace std;
    const int INF=0x3f3f3f3f;
    typedef long long LL;
    #define T_T while(T--)
    #define SI(x) scanf("%d",&x)
    #define mem(x,y) memset(x,y,sizeof(x))
    const int MAXN=1010;
    char s[MAXN];
    int a[30];
    int main(){
    	int T,len,kase=0;
    	SI(T);
    	T_T{
    		scanf("%s",s);
    		len=strlen(s);
    		mem(a,0);
    		int ans=INF;
    		for(int i=0;i<len;i++){
    			if(!a[s[i]-'a'])a[s[i]-'a']=i;
    			else ans=min(ans,i-a[s[i]-'a']),a[s[i]-'a']=i;
    		}
    		if(ans==INF)ans=-1;
    		printf("Case #%d: %d
    ",++kase,ans);
    	}
    	return 0;
    }
    

      

  • 相关阅读:
    PHP:_SERVER变量和_ENV变量列表
    一些使用jQuery開發的在線Web富文本編輯器
    xhtml+css排版,清理浮动整理汇总
    PHP 6 的新特性
    用PHP的CURL写的一个采集Discuz的例子
    SA、SD、SE 这三者的含义及区分
    PHP 之父 Rasmus Lerdorf 谈PHP开发
    http头的组成
    Jquery插件 可以随着滚动条的滚动而即时加载图片
    在你的网页中嵌入PDF等文件,实现pdf在线阅读
  • 原文地址:https://www.cnblogs.com/handsomecui/p/5012878.html
Copyright © 2011-2022 走看看