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 vote349 views1 answer
Curl upload folder and subfolders
C++
0 vote359 views1 answer
Store arbitrarly large vector of doubles c++
C++
14 votes349 views5 answers
Create a vector of size n in c++
C++
3 votes354 views1 answer
Infinite loop c++
C++
0 vote372 views1 answer
Inverse lerp c++
C++
8 votes329 views1 answer
Arduino for command
C++
0 vote330 views1 answer
How to seek to the start of afile in c++
C++
0 vote365 views1 answer
C++ add object to array
C++
8 votes421 views10 answers
Javascript loop array
C++
1 vote342 views1 answer
Gmod hitman job code
C++