using
System;
class
GFG {
public
class
pair {
public
int
first, second;
public
pair(
int
a,
int
b)
{
first = a;
second = b;
}
}
static
void
preCalculate(
int
[] binary,
int
n,
pair[] left)
{
int
count1 = 0, count0 = 0;
for
(
int
i = 0; i < n; i++) {
left[i].first = count1;
left[i].second = count0;
if
(binary[i] != 0)
count1++;
else
count0++;
}
}
public
static
void
Main(String[] args)
{
int
[] binary = { 1, 1, 1, 0, 0, 1, 0, 1, 1 };
int
n = binary.Length;
pair[] left =
new
pair[n];
for
(
int
i = 0; i < n; i++)
left[i] =
new
pair(0, 0);
preCalculate(binary, n, left);
int
[] queries = { 0, 1, 2, 4 };
int
q = queries.Length;
for
(
int
i = 0; i < q; i++)
Console.WriteLine(left[queries[i]].first +
" ones "
+ left[queries[i]].second +
" zeros\n"
);
}
}