#include <iostream>
using namespace std;
typedef long long LL;
const int N = 1010;
int r[N];
int main()
{
int n;
cin >> n;
for (int i = 0; i < n; i ++ ) cin >> r[i];
LL res = 1e9;
for (int i = 0; i < n; i ++ ) //如何枚举每个起点
{
LL sum = 0;
for (int j = 0; j < n; j ++ )
sum += j * r[(i + j) % n];
res = min(res, sum);
}
printf("%lld\n", res);
return 0;
}
圆形牛棚——USACO 2016 February Contest Bronze
于 2023-02-12 16:33:04 首次发布