2735. Collecting Chocolates

You are given a 0-indexed integer array nums of size n representing the cost of collecting different chocolates. Each chocolate is of a different type, and originally, the chocolate at ith index is of ith type.

In one operation, you can do the following with an incurred cost of x:

• Simultaneously change the chocolate of ith type to (i + 1)th type for all indexes i where 0 <= i < n - 1. When i == n - 1, that chocolate will be changed to type of the chocolate at index 0.

Return the minimum cost to collect chocolates of all types, given that you can perform as many operations as you would like.

class Solution {
public:
    long long minCost(vector<int>& nums, int x) {
        long long res = 0, n = nums.size(), sum = 0;
        for(int i = 0; i < n; i++) res += nums[i], sum += nums[i];
        for(int r = 1; r <= n; r++) {
            vector<int> A(n);
            for(int i = 0; i < n; i++) {
                sum -= nums[i];
                A[i] = min(nums[i], nums[(i+1) % n]);
                sum += A[i];
            }
            sum += x;
            swap(A,nums);
            res = min(res, sum);
        }
        return res;
    }
};