Problem

Source: Indonesia TSTST - Combinatoric

Tags: combinatorics, maximization, Indonesia, Indonesia TST



Given a sequence of integers A1,A2,A99 such that for every sub-sequence that contains m consecutive elements, there exist not more than max{m3,1} odd integers. Let S={(i,j) |i<j} such that Ai is even and Aj is odd. Find max{|S|}.