A8409 | Ice Sculptures
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
The Berland University is preparing to celebrate the 256-th anniversary of its founding! A specially appointed Vice Rector for the celebration prepares to decorate the campus. In the center of the campus $n$ ice sculptures were erected. The sculptures are arranged in a circle at equal distances from each other, so they form a regular $n$ -gon. They are numbered in clockwise order with numbers from 1 to $n$ .
The site of the University has already conducted a voting that estimated each sculpture's characteristic of $t_{i}$ — the degree of the sculpture's attractiveness. The values of $t_{i}$ can be positive, negative or zero.
When the university rector came to evaluate the work, he said that this might be not the perfect arrangement. He suggested to melt some of the sculptures so that:
- the remaining sculptures form a regular polygon (the number of vertices should be between 3 and $n$ ),
- the sum of the $t_{i}$ values of the remaining sculptures is maximized.
Help the Vice Rector to analyze the criticism — find the maximum value of $t_{i}$ sum which can be obtained in this way. It is allowed not to melt any sculptures at all. The sculptures can not be moved.
The site of the University has already conducted a voting that estimated each sculpture's characteristic of $t_{i}$ — the degree of the sculpture's attractiveness. The values of $t_{i}$ can be positive, negative or zero.
When the university rector came to evaluate the work, he said that this might be not the perfect arrangement. He suggested to melt some of the sculptures so that:
- the remaining sculptures form a regular polygon (the number of vertices should be between 3 and $n$ ),
- the sum of the $t_{i}$ values of the remaining sculptures is maximized.
Help the Vice Rector to analyze the criticism — find the maximum value of $t_{i}$ sum which can be obtained in this way. It is allowed not to melt any sculptures at all. The sculptures can not be moved.
输入格式
The first input line contains an integer $n$ ( $3<=n<=20000$ ) — the initial number of sculptures. The second line contains a sequence of integers $t_{1},t_{2},...,t_{n}$ , $t_{i}$ — the degree of the $i$ -th sculpture's attractiveness ( $-1000<=t_{i}<=1000$ ). The numbers on the line are separated by spaces.
输出格式
Print the required maximum sum of the sculptures' attractiveness.
输入输出样例
输入 #1
8 1 2 -3 4 -5 5 2 3
输出 #1
14
输入 #2
6 1 -2 3 -4 5 -6
输出 #2
9
输入 #3
6 1 2 3 4 5 6
输出 #3
21
In the first sample it is best to leave every second sculpture, that is, leave sculptures with attractivenesses: 2, 4, 5 и 3.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted