USA TSTST 2015 - P1

For discussing Olympiad Level Combinatorics problems
rah4927
Posts:110
Joined:Sat Feb 07, 2015 9:47 pm
USA TSTST 2015 - P1

Unread post by rah4927 » Sun Aug 21, 2016 10:39 pm

Let $a_1, a_2, \dots, a_n$ be a sequence of real numbers, and let $m$ be a fixed positive integer less than $n$. We say an index $k$ with $1\le k\le n$ is good if there exists some $\ell$ with $1\le \ell \le m$ such that $a_k+a_{k+1}+...+a_{k+\ell-1}\ge0$, where the indices are taken modulo $n$. Let $T$ be the set of all good indices. Prove that $\sum\limits_{k \in T}a_k \ge 0$.

User avatar
Thanic Nur Samin
Posts:176
Joined:Sun Dec 01, 2013 11:02 am

Re: USA TSTST 2015 - P1

Unread post by Thanic Nur Samin » Mon Aug 22, 2016 9:28 pm

Hint
Use greedy algorithm. Take the groups of consecutive $a_i$'s of minimal length.
Hammer with tact.

Because destroying everything mindlessly isn't cool enough.

Post Reply