DP

Author: Skm2000

Longest_Decreasing_Subsequence.cpp

@@ -0,0 +1,23 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int LDS(int a[],int size){
+    int dp[size+1],res=1;
+    for(int i=0;i<size;i++){
+        dp[i] = 1;
+    }
+    for(int i=size-1;i>=0;i--){
+        for(int j=0;j<i;j++){
+            if(a[i]>a[j]){
+                dp[i] = max(dp[i],1+dp[j]);
+            }
+        }
+        res = max(res,dp[i]);
+    }
+    return res;
+}
+int main(){
+    int a[] = {10,9,2,5,3,7,101,18};
+    int size = sizeof(a)/sizeof(a[0]);
+    cout<<LDS(a,size)<<"\n";
+}

Longest_Increasing_Subsequence.cpp

@@ -0,0 +1,24 @@
+#include<bits/stdc++.h>
+using namespace std;
+
+int LIS(int a[],int size){
+    int dp[size+1],res=1;
+    for(int i=0;i<size;i++){
+        dp[i] = 1;
+    }
+    for(int i=0;i<size;i++){
+        for(int j=0;j<i;j++){
+            if(a[i]>a[j]){
+                dp[i] = max(dp[i],1+dp[j]);
+            }
+        }
+        res = max(res,dp[i]);
+    }
+    return res;
+}
+int main(){
+    int a[] = {10,9,2,5,3,7,101,18};
+    int size = sizeof(a)/sizeof(a[0]);
+    reverse(a,a+size);
+    cout<<LIS(a,size)<<"\n";
+}

Maximum_Sum_Decreasing_Subsequence.cpp

@@ -0,0 +1,29 @@
+#include<bits/stdc++.h>
+using namespace std;
+int MSDS(int a[],int size){
+    int dp[size];
+    for(int i=0;i<size;i++){
+        dp[i] = a[i];
+    }
+    for(int i=1;i<size;i++){
+        for(int j=0;j<i;j++){
+            if(a[i]>a[j] && dp[i]<a[i]+dp[j]){
+                dp[i] = a[i]+dp[j];
+            }
+        }
+    }
+    int max = dp[0];
+    for(int i=1;i<size;i++){
+        if(dp[i]>max){
+            max = dp[i];
+        }
+    }
+    return max;
+}
+
+int main(){
+    int a[] = {1, 101, 2, 3, 100, 4, 5};  
+    int size = sizeof(a)/sizeof(a[0]);
+    reverse(a,a+size);
+    cout<<MSDS(a,size)<<"\n";  
+}

Maximum_Sum_Increasing_Subsequence.cpp

@@ -0,0 +1,28 @@
+#include<bits/stdc++.h>
+using namespace std;
+int MSIS(int a[],int size){
+    int dp[size];
+    for(int i=0;i<size;i++){
+        dp[i] = a[i];
+    }
+    for(int i=1;i<size;i++){
+        for(int j=0;j<i;j++){
+            if(a[i]>a[j] && dp[i]<a[i]+dp[j]){
+                dp[i] = a[i]+dp[j];
+            }
+        }
+    }
+    int max = dp[0];
+    for(int i=1;i<size;i++){
+        if(dp[i]>max){
+            max = dp[i];
+        }
+    }
+    return max;
+}
+
+int main(){
+    int a[] = {1, 101, 2, 3, 100, 4, 5};  
+    int size = sizeof(a)/sizeof(a[0]);
+    cout<<MSIS(a,size)<<"\n";  
+}