codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1760E.md (2131B)


      1 Source: https://codeforces.com/problemset/problem/1760/E
      2 
      3 E. Binary Inversions
      4 
      5 time limit per test
      6 
      7 2 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 You are given a binary array$^{\dagger}$ of length $n$. You are allowed to perform one operation on it at most once. In an operation, you can choose any element and flip it: turn a $0$ into a $1$ or vice-versa.
     22 
     23 What is the maximum number of inversions$^{\ddagger}$ the array can have after performing at most one operation?
     24 
     25 $^\dagger$ A binary array is an array that contains only zeroes and ones.
     26 
     27 $^\ddagger$ The number of inversions in an array is the number of pairs of indices $i,j$ such that $i \lt j$ and $a_i \gt a_j$.
     28 
     29 Input
     30 
     31 The input consists of multiple test cases. The first line contains an integer $t$ ($1 \leq t \leq 10^4$) — the number of test cases. The description of the test cases follows.
     32 
     33 The first line of each test case contains an integer $n$ ($1 \leq n \leq 2\cdot10^5$) — the length of the array.
     34 
     35 The following line contains $n$ space-separated positive integers $a_1$, $a_2$,..., $a_n$ ($0 \leq a_i \leq 1$) — the elements of the array.
     36 
     37 It is guaranteed that the sum of $n$ over all test cases does not exceed $2\cdot10^5$.
     38 
     39 Output
     40 
     41 For each test case, output a single integer  — the maximum number of inversions the array can have after performing at most one operation.
     42 
     43 Example
     44 
     45 Input
     46 
     47 ```
     48 5
     49 
     50 4
     51 
     52 1 0 1 0
     53 
     54 6
     55 
     56 0 1 0 0 1 0
     57 
     58 2
     59 
     60 0 0
     61 
     62 8
     63 
     64 1 0 1 1 0 0 0 1
     65 
     66 3
     67 
     68 1 1 1
     69 ```
     70 
     71 Output
     72 
     73 ```
     74 3
     75 7
     76 1
     77 13
     78 2
     79 ```
     80 
     81 Note
     82 
     83 For the first test case, the inversions are initially formed by the pairs of indices ($1, 2$), ($1, 4$), ($3, 4$), being a total of $3$, which already is the maximum possible.
     84 
     85 For the second test case, the inversions are initially formed by the pairs of indices ($2, 3$), ($2, 4$), ($2, 6$), ($5, 6$), being a total of four. But, by flipping the first element, the array becomes ${1, 1, 0, 0, 1, 0}$, which has the inversions formed by the pairs of indices ($1, 3$), ($1, 4$), ($1, 6$), ($2, 3$), ($2, 4$), ($2, 6$), ($5, 6$) which total to $7$ inversions which is the maximum possible.