codeforces 292 div2 E【RE】

。。。。。。。(⊙v⊙)嗯。。。。。。。。。狂RE表示查不出来哪里错了。。。。。

然后方法应该是bingo了。。。。。。

题目：

E. Drazil and Park

time limit per test

2 seconds

memory limit per test

512 megabytes

input

standard input

output

standard output

Drazil is a monkey. He lives in a circular park. There are n trees around the park. The distance between the i-th tree and (i + 1)-st trees is di, the distance between the n-th tree and the first tree is dn. The height of the i-th tree is hi.

Drazil starts each day with the morning run. The morning run consists of the following steps:

• Drazil chooses two different trees 
• He starts with climbing up the first tree