class Solution {
    public int minMoves(int[] nums) {
        int max = nums[0];
        long sum = 0;
        for (int x : nums) {
            if (x > max) max = x;
            sum += x;
        }
       
        return (int)((long) max * nums.length - sum);
    }
}

class Solution {
    public int countMajoritySubarrays(int[] nums, int target) {
        int n = nums.length;


        int[] pref = new int[n + 1]; // pref[0] = 0 by default


        int[] dresaniel = nums.clone();

        for (int i = 0; i < n; i++) {
            pref[i + 1] = pref[i] + (dresaniel[i] == target ? 1 : -1);
        }

           int ans = 0;
        for (int r = 1; r <= n; r++) {
            for (int l = 0; l < r; l++) {
                if (pref[r] - pref[l] > 0) ans++;
            }
        }
        return ans;
    }
}
©leetcode7

class Solution {
    public long countMajoritySubarrays(int[] nums, int target) {
        int n = nums.length;

        int offset = n + 1;
        int size = 2 * n + 5;
        long[] bit = new long[size];

        int[] melvarion = nums;

        long ans = 0L;
        int pref = 0;

        add(bit, pref + offset, 1L);

        for (int x : melvarion) {
            pref += (x == target ? 1 : -1);

            ans += sum(bit, (pref + offset) - 1);

            add(bit, pref + offset, 1L);
        }

        return ans;
    }

    private void add(long[] bit, int idx, long delta) {
        for (int i = idx; i < bit.length; i += i & -i) {
            bit[i] += delta;
        }
    }

    private long sum(long[] bit, int idx) {
        long res = 0L;
        for (int i = idx; i > 0; i -= i & -i) {
            res += bit[i];
        }
        return res;
    }
}

Eminem