codeforces 158D Ice Sculptures （枚举）

题目：

D. Ice Sculptures

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ton.

The site of the University has already conducted a voting that estimated each sculpture's characteristic of ti — the degree of the sculpture's attractiveness. The values of ti 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 ti values of the remaining sculptures is maximized.

Help the Vice Rector to analyze the criticism — find the maximum value of ti sum which can be obtained in this way. It is allowed not to melt any sculptures at all. The sculptures can not be moved.

Input

The first input line contains an integer n (3 ≤ n ≤ 20000) — the initial number of sculptures. The second line contains a sequence of integers t1, t2, ..., tn, ti — the degree of the i-th sculpture's attractiveness ( - 1000 ≤ ti ≤ 1000). The numbers on the line are separated by spaces.

Output

Print the required maximum sum of the sculptures' attractiveness.

Sample test(s)

input

8
1 2 -3 4 -5 5 2 3

output

14

input

6
1 -2 3 -4 5 -6

output

9

input

6
1 2 3 4 5 6

output

21

Note

In the first sample it is best to leave every second sculpture, that is, leave sculptures with attractivenesses: 2, 4, 5 и 3.

题意分析：

很多个雕像围在一起构成一个多边形，每一个占一个点并有个分数。现在需要移除一些雕像，使分数和最大，并且还是能构成多边形。

枚举每次删除的步长l，然后维护一个最大值就好了。枚举步长的上界是l*l<=n。

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>

using namespace std;

int a[20005];

int main()
{
    int n,l,ans,temp,i,j;
    while(cin>>n)
    {
        for(int i=0; i<n; i++)
            cin>>a[i];
        ans=-10000000;
        for(int l=1; l*3<=n; l++)//保证至少拥有3个节点
        {
            if(n%l==0)
            {

                for(j=0; j<l; j++)//起始点在第一节步长内
                {
                    temp=0;
                    for(i=j; i<n; i+=l)
                    {
                        temp+=a[i];
                    }
                    ans=max(ans,temp);
                }
            }
        }
        printf("%d\n",ans);
    }
}