Case of the Zeros and Ones 分类: CF 2015-07-24 11:05 15人阅读 评论(0) 收藏
2015-07-24 11:05
429 查看
A. Case of the Zeros and Ones
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.
Once he thought about a string of length n consisting of zeroes and ones. Consider the following operation: we choose any twoadjacent positions in the string, and if one them contains
0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of lengthn - 2 as a result.
Now Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.
Input
First line of the input contains a single integer n (1 ≤ n ≤ 2·105), the length of the string that Andreid has.
The second line contains the string of length n consisting only from zeros and ones.
Output
Output the minimum length of the string that may remain after applying the described operations several times.
Sample test(s)
Input
Output
Input
Output
Input
Output
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.
Once he thought about a string of length n consisting of zeroes and ones. Consider the following operation: we choose any twoadjacent positions in the string, and if one them contains
0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of lengthn - 2 as a result.
Now Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.
Input
First line of the input contains a single integer n (1 ≤ n ≤ 2·105), the length of the string that Andreid has.
The second line contains the string of length n consisting only from zeros and ones.
Output
Output the minimum length of the string that may remain after applying the described operations several times.
Sample test(s)
Input
4 1100
Output
0
Input
5
01010
Output
1
Input
8
11101111
Output
6 CF的一道水题#include <iostream> #include <cstdio> #include <cmath> #include <cstdlib> #include <cstring> #include <stack> #include <algorithm> using namespace std; const int MAX = 200200; char str[MAX]; int main() { int n; scanf("%d",&n); scanf("%s",str); int a=0,b=0; for(int i=0;i<n;i++) { if(str[i]=='0') { a++; } else { b++; } } int sum=abs(a-b); printf("%d\n",sum); return 0; }
相关文章推荐
- 浅谈 css3 box盒子模型以及box-flex的使用
- Schema.xml和solrconfig.xml属性分析
- sata3 devices如何偵測
- emulator: ERROR: x86 emulation currently requires hardware acceleration!Please ensure Intel HAXM is
- Unity3d摄影机晃动特效【C#脚本】
- Android 关闭多个视图Intent.FLAG_ACTIVITY_CLEAR_TOP用法
- ./configure 时如何换行(使用续行符)
- C#值传递和按引用传递
- js-处理千分符
- 用js删除空白节点
- 比大小
- 用Java编写你自己的简单HTTP服务器
- sql之left join、right join、inner join的区别
- 黑马程序员——Java多线程线程间通信之Lock的应用
- Moses在Ubuntu14.04平台的安装过程
- KMP算法(部分重要代码)
- C#调用C/C++动态库 封送结构体,结构体数组
- Linux中的内存管理
- CAtlDllModuleT Class
- 基于Python的标准库tkinter创建面向对象的GUI应用程序