求助,42pts
查看原帖
求助,42pts
787888
Channel_Choo楼主2024/9/6 17:09
#include <iostream>
using namespace std;
char map[55][55];
int main()
{
    int n, m, w[55] = {0}, b[55] = {0}, r[55] = {0};
    cin >> n >> m;
    for (int i = 1;i <= n;i++)
    {
        for (int j = 1;j <= m;j++)
        {
            cin >> map[i][j];
        }
    }
    for (int i = 1;i <= n;i++)
    {
        for (int j = 1;j <= m;j++)
        {
            if (map[i][j] != 'W')
            {
            	w[i]++;
			}
			if (map[i][j] != 'B')
			{
				b[i]++;
			}
			if (map[i][j] != 'R')
			{
				r[i]++;
			}
        }
    }
    /*cout << "\n";
    for (int i = 1;i <= n;i++)
    {
    	cout << w[i] << " ";
	}
	cout << "\n";
	for (int i = 1;i <= n;i++)
    {
    	cout << b[i] << " ";
	}
	cout << "\n";
	for (int i = 1;i <= n;i++)
    {
    	cout << r[i] << " ";
	}
	cout << "\n";*/
	int ans = 10000000, wsum = 0, bsum = 0, rsum = 0;
	for (int i = 1;i <= n - 2;i++)
	{
		wsum += w[i];
		bsum = 0, rsum = 0;	
		for (int j = i + 1;j <= n - 1;j++)
		{
			bsum += b[j];
			for (int k = j + 1;k <= n;k++)
			{
				rsum += r[k];
			}
			int sum = wsum + rsum + bsum;
			ans = min(sum, ans);
		}
	}
	cout << ans;
	return 0;
}

#1#2#3可以过,#4#5#6#7WA求助

2024/9/6 17:09
加载中...