Find maximum contiguous Sub arrays

#include <iostream>
using namespace std;
int main(){
    int n;
    cin >> n;
    int arr[n];
    for(int i =0;i< n;i++){
        cin >> arr[i];
    }
    
    for (int i = 0; i < n; i++)
    {
        for (int j = i; j < n; j++)
        {
            for (int k = i; k <= j; k++)
            {
                cout << arr[k] << " ";
            }
            cout << endl;
        }
        
    }
    

    return 0;
}

Similar codes

2 votes191 views1 answer
Unordered_map of pair and int
C++
-1 vote139 views1 answer
Dynamic 2d array c++
C++
8 votes192 views2 answers
Built in factorial function in c++
C++
4 votes185 views3 answers
Fork c
C++
5 votes183 views6 answers
While loop in c++
C++
-1 vote205 views5 answers
Memset in cpp
C++
0 vote213 views2 answers
Method
C++
1 vote252 views1 answer
How to compile opencv c++ in ubuntu
C++
10 votes231 views3 answers
C++ check if file exits
C++
5 votes195 views2 answers
C++ contains
C++