首先从一道ACM简单题说起:问题 B: Friendship of Mouse时间限制: 1 Sec 内存限制: 64 MB提交: 24 解决: 15[提交][状态][讨论版]题目描述Today in KBW, N mice from different cities are standing in a line. Eachcity is represent
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 an
首先从一道ACM简单题说起:问题 B: Friendship of Mouse时间限制: 1 Sec 内存限制: 64 MB提交: 24 解决: 15[提交][状态][讨论版]题目描述Today in KBW, N mice from different cities are standing in a line. Eachcity is represent