B. Ohana Cleans Up(Codeforces Round #309 (Div. 2))
Ohana Matsumae is trying to clean a room, which is divided up into an n by n grid
of squares. Each square is initially either clean or dirty. Ohana can sweep her broom over columns of the grid. Her broom is very strange: if she sweeps over a clean square, it will become dirty, and if she sweeps over a dirty square, it will become clean.
She wants to sweep some columns of the room to maximize the number of rows that are completely clean. It is not allowed to sweep over the part of the column, Ohana can only sweep the whole column.
Return the maximum number of rows that she can make completely clean.
The first line of input will be a single integer n (1 ≤ n ≤ 100).
The next n lines will describe the state of the room. The i-th
line will contain a binary string with n characters denoting the state of the i-th
row of the room. The j-th character on this line is '1' if the j-th
square in the i-th row is clean, and '0' if it is dirty.
The output should be a single line containing an integer equal to a maximum possible number of rows that are completely clean.
4
0101
1000
1111
0101
2
3
111
111
111
3
In the first sample, Ohana can sweep the 1st and 3rd columns. This will make the 1st and 4th row be completely clean.
In the second sample, everything is already clean, so Ohana doesn't need to do anything.
题意:每次改变一列的值(0变1,1变0)问最后最大有多少行全为1。
思路:不须要管全一或者全零由于他们是能够相互转换的,所以仅仅要比較初始状态,每行状态,取最多的就好了。
题目链接:http://codeforces.com/contest/554/problem/B
转载请注明出处:寻找&星空の孩子
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std; char a[105][105]; int main()
{
int n,i,j,ans = 0;
scanf("%d",&n);
for(i = 0;i<n;i++)
{
scanf("%s",a[i]);
}
for(i = 0;i<n;i++)
{
int s = 0;
for(j = 0;j<n;j++)
{
if(strcmp(a[i],a[j])==0)
s++;
}
ans = max(ans,s);
}
printf("%d\n",ans);
}
最新文章
- Oracle参数化查询
- jsp_属性范围_session
- Nginx 启动脚本/重启脚本
- PushKit和传统长连接方式的比较
- is(C# 参考)
- Linux体系结构(二): Linux系统层次
- mvc中使用knockoutjs和ajax
- centos 彻底删除nodejs默认的安装文件
- HashMap和Hashtable的同和不同
- git基本命令--tag, alias,
- 用CSS让文字居于div的底部
- 菱形开合的实现 IOS
- python3基础(七)函数基础
- Centos下的GitLab的安装汉化和数据备份以及管理员密码重置
- ap module omap4460
- Myeclipse使用git
- css解决内联元素间的空白间隔
- RandomShuffleQueue
- 缺省源和 Vim 配置
热门文章
- 【HackerRank Week of Code 31】Colliding Circles
- BZOJ 3751: [NOIP2014]解方程 数学
- Codeforces Round #FF (Div. 1) B. DZY Loves Modification 优先队列
- Spring Batch 批处理框架介绍
- 亚马逊API的使用
- HP Microserver Gen8 Processor FAQ
- 解决idea 控制台中文乱码
- 通过扩展jQuery UI Widget Factory实现手动调整Accordion高度
- 由于拷贝的文件太大,不可能一直开着SHELL,所以让SCP后台运行
- Spring事务处理探究