U597857 致谢

U597857 致谢

改AC后的您的代码

#include<bits/stdc++.h>
using namespace std;
string s;
char ss[100005];
int i1=1,f=0,t=1,n;

struct st
{
	string z;
	int sh,d;
}a[100005];

bool cmp(st a,st b){
	if(a.sh!=b.sh){
		return a.sh>b.sh;
	}
    else if(a.z!=b.z){
        return a.z<b.z;
    }
	else{
		return a.d<b.d;
	}
}

bool bijiao(string a,string b){
    if(n!=(int)b.size()){
    	return 0;
	}
	else{
		for(int i=0;i<n;i++){
			if(a[i]!=b[i]){
				return 0;
			}
		}
		return 1;
	}
}

int main(){
	// freopen("data.in","r",stdin);freopen("data.out","w",stdout);
	while(cin >> s){
		// cout << s << '\n';
		f = 0;// bool 要初始化！
		memset(ss,0,sizeof(ss));
		n = s.length();	
		for(int i = 0;i < n;i ++)
		{
			if(s[i] >= 'A' && s[i] <= 'Z') ss[i] = s[i] + 'a' - 'A';
			if(s[i] >= 'a' && s[i] <= 'z') ss[i] = s[i];
		} 
		s = ss;
		n = s.length();	
		for(int j=1;j<=t;j++){
			if(bijiao(s,a[j].z)){
				f=1;
				a[j].sh++;
				break;
			}
		}
		a[i1].d=i1;
		if(f==0){
			a[t].z=s;
			a[t].sh=1;
			t++;
		}
		i1++;
	}

	sort(a+1,a+t+1,cmp);
	for(int i=1;i<t;i++){
		cout<<a[i].z;
		cout<<":";
		cout<<a[i].sh<<endl;
	}
	return 0;
}

我的代码

#include<bits/stdc++.h>
#define Blue_Archive return 0
using namespace std;
const int N = 1e3 + 7;

int tot;

string s;
char t[N];

map<string,int> mp;
map<int,string> jk;

struct miku
{
	int len;
	string s;
}a[N];

inline bool cmp(miku a,miku b)
{
	if(a.len == b.len) return a.s < b.s;
	return a.len > b.len;
}

signed main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	while(cin >> s)
	{
		memset(t,0,sizeof(t));
		for(int i = 0;i < (int)s.length();i ++)
		{
			if(s[i] >= 'A' && s[i] <= 'Z') s[i] = s[i] - 'A' + 'a';
			if(s[i] >= 'a' && s[i] <= 'z') t[i] = s[i];
		}
		s = t;
		if(!mp[s])
		{
			tot ++;
			jk[tot] = s;
		}
		mp[s] ++;
	}
	for(int i = 1;i <= tot;i ++)
	{
		s = jk[i];
		a[i].len = mp[s];
		a[i].s = s;
	}
	sort(a + 1,a + tot + 1,cmp);
	for(int i = 1;i <= tot;i ++)
	{
		cout << a[i].s << ":" << a[i].len << '\n';
	}
	Blue_Archive;
}