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 vote145 views1 answer
Pop back innstring
C++
1 vote110 views1 answer
Cpp malloc
C++
-1 vote124 views1 answer
Arrays left rotation hackerrank solution
C++
0 vote112 views2 answers
C++ code
C++
0 vote106 views1 answer
Convert GLFWwindow* to IntPtr
C++
2 votes111 views3 answers
C++ lambda
C++
0 vote120 views1 answer
Life the universe and everything solution c++
C++
5 votes104 views3 answers
C++ random number within range
C++
0 vote126 views1 answer
What is imposter syndrome
C++
1 vote115 views1 answer
Google test assert eq float
C++