Brief description :

求出现次数最多的一个子串。

Analyse :

这是个水题。。。因为统计出出现次数最多的单个字符即可。＃

/*
	Author  : xiaodao
	Prob    : URAL 1723. Sandro's Book
	Status  : Accepted
	Last Modify : GMT +8 Sept 16th 11:28
	Tags : string algorithms
*/
#include 
#include 
using namespace std;
const int m = 256;
string s; int c[m], i, n;
int key; char ans;

int main(){
	while (cin >> s){
		key = 0; n = s.size();
		memset(c, 0, sizeof(c));
		for (i=0;i key){
				key = c[s[i]];
				ans = s[i];
			}
		}
		cout << ans << endl;
	}	
}

Posted by xiaodao
Category: 日常