- Forum
- General C++ Programming
- A dp task (i think) i cant solve
A dp task (i think) i cant solve
TASK STATEMENT:
you are given an array of N integers you should find 2 sub-arrays of consecutive elements with maximum sum.sub_arrays must not overlap, sum can be negative.
INPUT:
Firts line number N number of elements, second line contains N integers which represents the array.
OUTPUT:
a single integer representing maximal sum of two sub arrays.
Im struggling with this task a lot can someone help me i would realy appreciate it.i think this is dynamic programming task but im not sure , any explanation will help.
you are given an array of N integers you should find 2 sub-arrays of consecutive elements with maximum sum.sub_arrays must not overlap, sum can be negative.
INPUT:
Firts line number N number of elements, second line contains N integers which represents the array.
OUTPUT:
a single integer representing maximal sum of two sub arrays.
Im struggling with this task a lot can someone help me i would realy appreciate it.i think this is dynamic programming task but im not sure , any explanation will help.
| Im struggling with this task a lot can someone help me i would realy appreciate it. |
Your post doesn't show much in the way of struggle. Perhaps you could explain what you've already tried to solve the problem?
Topic archived. No new replies allowed.