OJ平台中的一个数组初始化问题

创建时间：2016-09-06 投稿人：浏览次数：113

首先从一道ACM简单题说起:

问题 B: Friendship of Mouse

时间限制: 1 Sec 内存限制: 64 MB
提交: 24 解决: 15
[提交][状态][讨论版]

题目描述

Today in KBW, N mice from different cities are standing in a line. Each city is represented by a lowercase letter. The distance between adjacent mice (e.g. the 1^st and the 2^nd mouse, the N−1^th and the N^th mouse, etc) are exactly 1. Two mice are friends if they come from the same city.

The closest friends are a pair of friends with the minimum distance. Help us find that distance.

声明：该文观点仅代表作者本人，入门客AI创业平台信息发布平台仅提供信息存储空间服务，如有疑问请联系rumenke@qq.com。