A13554. The Best Vacation
编程题
普及/提高-
知识点
题目描述
由于本场题面违反互联网相关法律，不予展示原题面。
输入格式
无
输出格式
无
输入输出样例
输入 #1
3 2 1 3 1
输出 #1
5
输入 #2
3 6 3 3 3
输出 #2
12
输入 #3
5 6 4 2 3 1 3
输出 #3
15
说明/提示
In the first test case, the numbers of the days in a year are (indices of days in a corresponding month) $\{1,1,2,3,1\}$ . Coronavirus-chan will hug you the most if you come on the third day of the year: $2+3=5$ hugs.
In the second test case, the numbers of the days are $\{1,2,3,1,2,3,1,2,3\}$ . You will get the most hugs if you arrive on the third day of the year: $3+1+2+3+1+2=12$ hugs.
In the third test case, the numbers of the days are $\{1,2,3,4,1,2, 1,2,3, 1, 1,2,3\}$ . You will get the most hugs if you come on the twelfth day of the year: your friend will hug you $2+3+1+2+3+4=15$ times.
In the second test case, the numbers of the days are $\{1,2,3,1,2,3,1,2,3\}$ . You will get the most hugs if you arrive on the third day of the year: $3+1+2+3+1+2=12$ hugs.
In the third test case, the numbers of the days are $\{1,2,3,4,1,2, 1,2,3, 1, 1,2,3\}$ . You will get the most hugs if you come on the twelfth day of the year: your friend will hug you $2+3+1+2+3+4=15$ times.