in c++

Maximum-sum subsequence

The maximum-sum subsequence is a contiguous subset of an array that has the maximum sum.

Example: Given the array [3, -5, 6 , 1, -2]

The maximum-sum subsequence of size 3 would be: [6, 1, -2] = 5

Write a function that generates a array of size 100 filled with random integers between-50 and 50. Ask the user for a number n between 5 and 15. Find the maximum-sum subsequence of size non the array you created. Print the original array, the maximum-sum sequence and the sum value.

Can you explain it for a better understanding please!