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 votes293 views2 answers
Anagram
C++
1 vote301 views1 answer
Sieve of eresthossis cp c++
C++
0 vote366 views2 answers
Is the c++ 20 char te same as the old one
C++
0 vote347 views1 answer
Warning: base will be initialized after
C++
0 vote308 views1 answer
C++ CHEAT SHEAT
C++
0 vote236 views1 answer
Prefix array algorithm in c++
C++
0 vote287 views1 answer
List of products on e commerce websites
C++
1 vote276 views1 answer
Delete a head node in link list
C++
0 vote305 views1 answer
Iff
C++
0 vote284 views1 answer
"how we write a program for" time swap" in c plus plus only with string"
C++