Maximum Sum Triplet
Problem Description
Given an array A containing N integers.
You need to find the maximum sum of triplet ( Ai + Aj + Ak ) such that i LESS THAN j LESS THAN k and Ai LESS THAN Aj LESS THAN Ak.
If no such triplet exist return 0.