3952. Fair Photography

Description

The number of positions on the axis has a kind of a, choose a maximum interval so that each kind of the occurrence of each species is equal and the number of species "=k
n<=100000,2" =k<=8, the number of species 8

Idea

In fact, about the interval problem, are all kinds of routines
here we can select the state s, we choose which of the types, so that the position of the match will come to a disjoint interval to
set out an interval [l,r]
we sweep through, Record the current position to the number of cattle in L, in finding the relative state (that is, all the number of cows in the state s minus the smallest of them) (4,6,5) into (0,2,1), if the previous occurrence of the relative state is (0,2,1), then the existence of a legal interval for
the same relative state , double hash time complexity can be used
(2^8*n*8)