CodeForces - 556A Case of the Zeros and Ones

标签：http   section   dex   log   amp   ntp   redo   describe   mit   

Once he thought about a string of length n consisting of zeroes and ones. Consider the following operation: we choose any two adjacentpositions 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 length n?-?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.

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 the minimum length of the string that may remain after applying the described operations several times.

4
1100

0

5
01010

1

8
11101111

6

var
  s:array[1..200005] of char;
  i,j,n,k,m1,m2:longint;
begin
  readln(n);
  for i:=1 to n do
  begin
    read(s[i]);
    if s[i]=‘1‘ then inc(m1);
    if s[i]=‘0‘ then inc(m2);
  end;
  writeln(abs(m1-m2));
end.

CodeForces - 556A Case of the Zeros and Ones

标签：http   section   dex   log   amp   ntp   redo   describe   mit   

原文地址：http://www.cnblogs.com/stxy-ferryman/p/7070475.html