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 vote103 views1 answer
Cuda lock
C++
0 vote107 views1 answer
C++ fill string with random uppercase letters
C++
0 vote104 views1 answer
At c++ vector
C++
0 vote107 views1 answer
Curl upload folder and subfolders
C++
0 vote107 views1 answer
Fisher–Yates shuffle Algorithm c++
C++
-1 vote108 views1 answer
2927260.eps 2927262.jpg 2927263.ai License free.txt License premium.txt
C++
1 vote107 views1 answer
For loop vector
C++
1 vote108 views1 answer
C++ print vector without loop
C++
1 vote116 views4 answers
Sum vector c++
C++
12 votes108 views3 answers
Max element in array c++ stl
C++