NOIP T1 是计数排序吗
  • 板块学术版
  • 楼主Xlw6friend
  • 当前回复11
  • 已保存回复12
  • 发布时间2023/11/18 17:24
  • 上次更新2023/11/18 18:51:03
查看原帖
NOIP T1 是计数排序吗
741169
Xlw6friend楼主2023/11/18 17:24

已删除freopen

#include <bits/stdc++.h>
using namespace std;
int n, m, cnt[3005][27], a[3005], big[3005], small[3005];//cnt记录在每个字符串种a~z出现的次数 
string w[3005];
bool flag;
int main()
{
	//freopen("dict4.in", "r", stdin);
	memset(small, 0x3f, sizeof(small));
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> w[i];
	for (int i = 1; i <= n; i++)
		for (int j = 0; j < m; j++)
		{
			int now = w[i][j] - 'a';
			cnt[i][now]++;
			big[i] = max(big[i], now);
			small[i] = min(small[i], now);
		}
	for (int i = 1; i <= n; i++)//当前 
	{
		flag = 1;
		for (int j = 1; j <= n; j++)
		{
			if (i==j) continue;
			if (small[i] > big[j] || (small[i]==big[j] && cnt[i][small[i]] >= cnt[j][big[j]]) )
			{
				flag = 0;
				break;
			}
		}
		a[i] = flag;
	}
	for (int i = 1; i <= n; i++) cout << a[i];
	return 0;
}
2023/11/18 17:24
加载中...