Solution: Maximum Sum of 3 Non-Overlapping Subarrays

C# solution for the Maximum Sum of 3 Non-Overlapping Subarrays problem using the Dynamic Programming pattern.