Daily-Problems-LeetCode/2256.MinimumAverageDifference.cpp at main · frostbyte012/Daily-Problems-LeetCode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include<bits/stdc++.h>
using namespace std;

class Solution {
public:
    int minimumAverageDifference(vector<int>& nums) {

        int n=nums.size(),min=INT_MAX,res;

        vector<long long>prefixsum(n+1);
        vector<long long>suffixsum(n+1);

        for(int i=0;i<n;i++)
        {
            prefixsum[i+1]=prefixsum[i]+nums[i];
        }
        for(int i=n-1;i>=0;i--)
        {
            suffixsum[i]=suffixsum[i+1]+nums[i];
        }

        for(int i=0;i<n;i++)
        {
            long long leftarraysumavg=prefixsum[i+1];

            leftarraysumavg/=(i+1);

            long long rightarraysumavg=suffixsum[i+1];

            if(i!=n-1)
            {
                rightarraysumavg/=(n-i-1);
            }

            if(abs(leftarraysumavg-rightarraysumavg)<min)
            {
                min=abs(leftarraysumavg-rightarraysumavg);
                res=i;
            }
        }

        return res;

    }
};