Dynamic Programming

fnf47 · Mar 6, 2017 · deec0f2 · deec0f2
1 parent def428e
commit deec0f2
Showing 1 changed file with 15 additions and 0 deletions.
diff --git a/DP/Longest_Bitonic_Subsequence/Problem_Statement.txt b/DP/Longest_Bitonic_Subsequence/Problem_Statement.txt
@@ -0,0 +1,15 @@
+
+//Longest Bitonic Subsequence.
+
+
+A subsequence of an array is called bitonic if the subsequence is,
+1) Strictly increasing
+OR
+2) Strictly decreasing
+OR
+3) First strictly increasing and then strictly decreasing.
+
+
+Related problem on spoj : http://www.spoj.com/problems/CODERE3/
+
+