max cut has been done

Author: gulshanyadav01

DynamicProgramming/editDistance.cpp

@@ -50,7 +50,7 @@ int editDistanceDp(string s1, string s2, int m, int n){
             }
 
             else{
-                dp[i][j] = 1 + min(dp[i][j-1], min(dp[i-1][j], dp[i-1][j-1])); 
+                dp[i][j] = 1 + min({dp[i][j-1],dp[i-1][j], dp[i-1][j-1]}); 
             }
 
         }

DynamicProgramming/lis.cpp

@@ -0,0 +1,10 @@
+/*
+author:gulshan yadav
+email: gulshany01@gmail.com
+date: 24-Aug-2021
+*/
+#include<iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+int longestIncreasing()

DynamicProgramming/maxCut.cpp

@@ -0,0 +1,39 @@
+/*
+author:gulshan yadav
+email: gulshany01@gmail.com
+date: 25-Aug-2021
+*/
+#include<iostream>
+#include<bits/stdc++.h>
+using namespace std;
+
+
+int maxCuts(int n, int a, int b, int c){
+
+    int dp[n+1]; 
+    dp[0] = 0; 
+
+    for(int i = 1; i<= n; i++){
+        dp[i] = -1; 
+
+        if(i-a >= 0) dp[i] = max(dp[i], dp[i-a]);
+        if(i-b >= 0) dp[i] = max(dp[i], dp[i-b]); 
+        if(i-c >= 0) dp[i] = max(dp[i], dp[i-c]); 
+        
+        if(dp[i] != -1) dp[i]++; 
+    }
+
+    return dp[n]; 
+
+}
+
+int main(){
+
+    int n,a,b,c; 
+    cin >>n >>  a >> b >> c; 
+
+    cout << maxCuts(n, a, b, c); 
+
+    return 0; 
+
+}