Coderforces F2. Same Sum Blocks (Hard)

F2. Same Sum Blocks (Hard)

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

This problem is given in two editions, which differ exclusively in the constraints on the number n

.

You are given an array of integers a[1],a[2],…,a[n].

A block is a sequence of contiguous (consecutive) elements a[l],a[l+1],…,a[r] (1≤l≤r≤n). Thus, a block is defined by a pair of indices (l,r)

.

Find a set of blocks (l1,r1),(l2,r2),…,(lk,rk)

such that:

• They do not intersect (i.e. they are disjoint). Formally, for each pair of blocks (li,ri)

and (lj,rj) where i≠j either ri<lj or rj<li

• .
• For each block the sum of its elements is the same. Formally,

  a[l1]+a[l1+1]+⋯+a[r1]=a[l2]+a[l2+1]+⋯+a[r2]=

⋯=