HackerRank university codesprint - kindergarten adventure - study code - score 30 (Maximum score 30) - segment tree

kindergartenAdventure_studycodeA.cs

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {
    static void Main(String[] args) {
        int n = int.Parse(Console.ReadLine());

        int[] A = Array.ConvertAll(Console.ReadLine().Split(' '), int.Parse);
        int[] w = new int[n];
        for (int i = 0; i < n; i++) {
            w[(n + i - A[i]) % n]++;
        }
        int k = 0, ans = 0;
        int bad = 0;

        for (int i = 0; i < n; i++) {
            if ((n + i - k) % n < A[i]) bad++;
        }

        int badans = bad;

        for (int i = 0; i < n; i++) {
            bad = bad - 1 + w[i];
            if (bad < badans) {
                badans = bad;
                ans = i+1;
            }
        }
        Console.WriteLine(ans + 1);

    }
}