[B12000] - Circular Barn(Bronze)

https://www.acmicpc.net/problem/12000

원형으로 돌기 때문에 index의 처리만 주의해주면 된다.

#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int n;
    cin >> n;
    vector<int>r(n);
    vector<int>check(n);
    for (int re = 0; re < n; re++)
    {
        check[re] = 0;
    }
    for (int i = 0; i < n; i++)
        cin >> r[i];
    int ans = 2147483647;
    int sum;
    for (int i = 0; i < n; i++)
    {
        for (int re = 0; re < n; re++)
        {
            check[re] = 0;
        }
        sum = 0;
        check[i] = 1;
        for (int k = 1; k < n; k++)
        {
            int index1 = i + k;
            while (index1 >= n)
                index1 -= n;
            if (check[index1]==0)
            {
                sum += k * r[index1];
                check[index1] = 1;
            }
        }
        if (sum < ans)
            ans = sum;
    }
    cout << ans << '\n';
}