http://codeforces.com/problemset/problem/672/B
A wise man told Kerem "Different is good" once, so Kerem wants all things in his life to be different.
Kerem recently got a string s consisting of lowercase English letters. Since Kerem likes it when things are different, he wants allsubstrings of his string s to be distinct. Substring is a string formed by some number of consecutive characters of the string. For example, string "aba" has substrings "" (empty substring), "a", "b", "a", "ab", "ba", "aba".
If string s has at least two equal substrings then Kerem will change characters at some positions to some other lowercase English letters. Changing characters is a very tiring job, so Kerem want to perform as few changes as possible.
Your task is to find the minimum number of changes needed to make all the substrings of the given string distinct, or determine that it is impossible.
The first line of the input contains an integer n (1 ≤ n ≤ 100 000) — the length of the string s.
The second line contains the string s of length n consisting of only lowercase English letters.
If it's impossible to change the string s such that all its substring are distinct print -1. Otherwise print the minimum required number of changes.
2 aa
1
4 koko
2
5 murat
0
In the first sample one of the possible solutions is to change the first character to 'b'.
In the second sample, one may change the first character to 'a' and second character to 'b', so the string becomes "abko".
题意:
给定一串长度为 n 的字符串,问最少修改多少次能够使该串没有重复的字母。
思路:
很简单的思路,考虑长度过长输出 -1;
长度< 27 的时候统计各个字母出现的次数,最后修改的次数 -1 就可以了。
CODE:
#include<stdio.h>
#include<string.h>
const int MYDD=1103+1e5;
char dd[MYDD];
int main() {
int n;
int appear[32];//appear[j]记录字母表中字母 j 出现的次数 appear[j]
while(scanf("%d",&n)!=EOF) {
scanf("%s",dd);
if(n>26) {//长度超过 26 不可能完成修改
puts("-1");
continue;
}
memset(appear,0,sizeof(appear));
for(int j=0; j<strlen(dd); j++) {
appear[dd[j]-'a'+1]++;//字母出现的次数
}
int ans=0;
for(int j=0; j<32; j++)
if(appear[j]>1) ans+=(appear[j]-1);
printf("%d\n",ans);
}
return 0;
}