关闭

A 2Char

229人阅读 评论(0) 收藏 举报
分类:

A. 2Char
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Andrew often reads articles in his favorite magazine 2Char. The main feature of these articles is that each of them uses at most two distinct letters. Andrew decided to send an article to the magazine, but as he hasn't written any article, he just decided to take a random one from magazine 26Char. However, before sending it to the magazine 2Char, he needs to adapt the text to the format of the journal. To do so, he removes some words from the chosen article, in such a way that the remaining text can be written using no more than two distinct letters.

Since the payment depends from the number of non-space characters in the article, Andrew wants to keep the words with the maximum total length.

Input

The first line of the input contains number n (1 ≤ n ≤ 100) — the number of words in the article chosen by Andrew. Following are n lines, each of them contains one word. All the words consist only of small English letters and their total length doesn't exceed 1000. The words are not guaranteed to be distinct, in this case you are allowed to use a word in the article as many times as it appears in the input.

Output

Print a single integer — the maximum possible total length of words in Andrew's article.

Sample test(s)
Input
4
abb
cacc
aaa
bbb
Output
9
Input
5
a
a
bcbcb
cdecdecdecdecdecde
aaaa
Output
6
Note

In the first sample the optimal way to choose words is {'abb', 'aaa', 'bbb'}.

In the second sample the word 'cdecdecdecdecdecde' consists of three distinct letters, and thus cannot be used in the article. The optimal answer is {'a', 'a', 'aaaa'}.




#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;
#define maxn 1005
#define inf 0x3f3f3f3f
typedef long long LL;
char s[101][maxn];
int main()
{
	int n;
	freopen("in.txt", "r", stdin);
	while( ~scanf("%d", &n) ){
		int sum = 0;
		for(int i = 0; i < n; i++){
			scanf("%s", s[i]);
		}
		int res = 0;
		for(int i=0;i<26;i++)
			for(int j=i+1;j<26;j++){
				sum = 0;
				for(int k=0;k<n;k++){
					int t=0;
					while(s[k][t]){
						if(s[k][t] != i+'a' && s[k][t] != j+'a'){
							t=0;
							break;
						}
						t++;
					}	
					sum += t;	
				}
				res = max(sum, res);
			}
		printf("%d\n",res);
	}
}
		      	
				


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:85809次
    • 积分:2584
    • 等级:
    • 排名:第14123名
    • 原创:175篇
    • 转载:13篇
    • 译文:0篇
    • 评论:1条
    最新评论