find maximum contiguous sub arrays

1#include <iostream>
2using namespace std;
3int main(){
4    int n;
5    cin >> n;
6    int arr[n];
7    for(int i =0;i< n;i++){
8        cin >> arr[i];
9    }
10    
11    for (int i = 0; i < n; i++)
12    {
13        for (int j = i; j < n; j++)
14        {
15            for (int k = i; k <= j; k++)
16            {
17                cout << arr[k] << " ";
18            }
19            cout << endl;
20        }
21        
22    }
23    
24
25    return 0;
26}