DSA-Problem-Set-1/Maximum_sum_of_subarray_of_size_k.cpp at main · ankit-tiwari-dev/DSA-Problem-Set-1 · 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
46
47
48
49
50
//{ Driver Code Starts
#include<bits/stdc++.h>
using namespace std;

// } Driver Code Ends
class Solution{
public:
    long maximumSumSubarray(int k, vector<int> &arr , int n){
        int i = 0;
        int j = 0;
        long long sum = 0;
        long long maxi = INT_MIN;
        while(j < n)
        {
            sum += arr[j];
            if(j-i+1 < k)
                j++;
            else if(j-i+1 == k)
            {
                maxi = max(sum, maxi);
                sum -= arr[i];
                i++;
                j++;
            }
        }
        return maxi;
    }
};

//{ Driver Code Starts.
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int N,K;
        cin >> N >> K;;
        vector<int>Arr;
        for(int i=0;i<N;++i){
            int x;
            cin>>x;
            Arr.push_back(x);
        }
        Solution ob;
        cout << ob.maximumSumSubarray(K,Arr,N) << endl;
    }
    return 0;
}
// } Driver Code Ends