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

0 vote119 views1 answer
How to traverse string like array in cpp
C++
14 votes122 views1 answer
How to make a n*n 2d dynamic array in c++
C++
0 vote121 views1 answer
C++ define array with values
C++
0 vote124 views1 answer
PUBG_APIKEY=<your-api-key> npm t
C++
2 votes115 views6 answers
Loop in c++
C++
-1 vote116 views1 answer
Cod Cold War no recoil
C++
9 votes135 views4 answers
C++ vector print
C++
0 vote137 views1 answer
ALO
C++
11 votes126 views3 answers
Count occurrences of character in string c++
C++
1 vote159 views1 answer
Ceil value in c++ using formula
C++