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 to n.

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.

 暴力求解的。。。

就是等间隔取数，求其和最大值！！！

#include<stdio.h>
int aa[20110];


int main()
{
    
    
    int n;
    int res;
    int sum;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=1;i<=n;i++)
          scanf("%d",&aa[i]);
        res=-200000000;
        for(int i=1;i<=n/3;i++)
        {
            if(n%i!=0)continue;
            if(n/i<3)continue;
            for(int j=1;j<=i;j++)
            {
                sum=0;
                for(int k=j;k<=n;k+=i)
                  sum+=aa[k];
                if(sum>res) res=sum;
            }    
        }    
        
        
        printf("%d\n",res);
        
        
    }   
    return 0;
}

 


文章来源:http://www.cnblogs.com/kuangbin/archive/2012/03/05/2380627.html