CF846C Four Segments

You are given an array of $ n $ integer numbers. Let $ sum(l,r) $ be the sum of all numbers on positions from $ l $ to $ r $ non-inclusive ( $ l $ -th element is counted, $ r $ -th element is not counted). For indices $ l $ and $ r $ holds $ 0

The first line contains one integer number $ n $ ( $ 1

Choose three indices so that the value of $ res $ is maximal. If there are multiple answers, print any of them.