Problem 3416 · Hard

Subsequences with a Unique Middle Mode II

Count the size-5 subsequences whose middle element occurs strictly more often than every other value in that subsequence, modulo 1,000,000,007. The array can hold 100,000 numbers, so picks must be counted without listing them.

Open the interactive visualisation