P3392 涂条纹

 传送门

#include<iostream>
#include<stdio.h>
using namespace std;
#define int long long
#define d lld
const int N = 60, MAX = 1e18;
int n, m, cnt, ans = MAX;
char a[N][N];
struct clor {
	int w, b, r;
}sum[N];
signed main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++) 
		{
			cin >> a[i][j];
			if (a[i][j] != 'W') sum[i].w++;
			if (a[i][j] != 'B') sum[i].b++;
			if (a[i][j] != 'R') sum[i].r++;
		}
	}
	for (int i = 1; i <= n - 2; ++i) {
		int cnt = 0;
		for (int i = 1; i <= i; ++i) cnt += sum[i].w;
		int t = cnt;
		for (int b = i + 1; b <= n - 1; ++b) {
			cnt = t;
			for (int i = i + 1; i <= b; ++i) cnt += sum[i].b;
			for (int i = b + 1; i <= n; ++i) cnt += sum[i].r;
			ans = min(ans, cnt);
		}
	}
	cout << ans << endl;
	return 0;
}