#include <iostream> #include <cstdio> #include <cstring> #include <string> using namespace std; #define max(a,b) (a)>(b)?(a):(b) #define MAXN 10010 typedef long long ll; const int mod=1000000009; int n; int x[MAXN][3]; int main() { while(~scanf("%d",&n)) { char tmp[2]; for(int i = 0;i<n;i++){ for(int j = 0;j<3;j++){ scanf("%s",tmp); if(tmp[0]=='R') x[i][j] = 1; else x[i][j] = 0; } } int ans=0; for(int i=0;i<(1<<3);i++) //枚举状态 { int tmp=0; int flag[3]; for(int j=0;j<3;j++) flag[j]=(i&(1<<j))>0; for(int j=0;j<n;j++) { int cnt[2]={0}; for(int k=0;k<3;k++) cnt[x[j][k]^flag[k]]++; tmp+=max(cnt[0],cnt[1]); } ans=max(ans,tmp); } printf("%d\n",ans); } return 0; } |
Double click to view unformatted code.