Added C++ solutions of (SPOJ)MISERMAN, (SPOJ)MPILOT and (SPOJ)PARTY

Author: rishab1128

Dynamic Programming/(SPOJ)MISERMAN.cpp

@@ -0,0 +1,81 @@
+//Author: rishab_1128
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define Min(x,y,z)  min(x,min(y,z))
+
+void solve()
+{
+	int n,m;
+	cin>>n>>m;
+
+	int**fares=new int*[n];
+	for(int i=0; i<n; i++)
+	{
+		fares[i]=new int[m];
+		for(int j=0; j<m; j++)
+			cin>>fares[i][j];
+	}
+
+	int**dp=new int*[n];
+	for(int i=0; i<n; i++)
+	{
+		dp[i]=new int[m];
+	}
+
+	//Initialising the 1st row of the DP
+	for(int j=0; j<m; j++)
+	{
+		dp[0][j]=fares[0][j];
+	}
+
+	for(int i=1; i<n; i++)
+	{
+		for(int j=0; j<m; j++)
+		{
+			if(j==0)
+				dp[i][j]=min(dp[i-1][j],dp[i-1][j+1])+fares[i][j];
+			else if(j==m-1)
+				dp[i][j]=min(dp[i-1][j],dp[i-1][j-1])+fares[i][j];
+			else
+				dp[i][j]=Min(dp[i-1][j],dp[i-1][j+1],dp[i-1][j-1])+fares[i][j];
+		}
+	}
+
+	int ans=INT_MAX;
+	for(int j=0; j<m; j++)
+	{
+		ans=min(ans,dp[n-1][j]);
+	}
+
+	//Deleting the fares and DP array
+	for(int i=0; i<n; i++)
+	{
+		delete[]fares[i];
+		delete[]dp[i];
+	}
+	delete[]fares;
+	delete[]dp;
+
+	cout<<ans<<endl;
+
+}
+
+int main()
+{
+	std::ios::sync_with_stdio(false);
+
+	#ifndef ONLINE_JUDGE
+	freopen("input.txt","r",stdin);
+	freopen("output.txt","w",stdout);
+	#endif
+
+	int t=1;
+	//cin>>t;
+	while(t--)
+	{
+		solve();
+	}
+    return 0;
+}

Dynamic Programming/(SPOJ)MPILOT.cpp

@@ -0,0 +1,71 @@
+//Author: rishab_1128
+
+#include<bits/stdc++.h>
+using namespace std;
+
+int dp[10005][5005];
+
+int func(int n, int*cap, int*asst, int diff)
+{
+	if(dp[n][diff]!=-1)
+		return dp[n][diff];
+
+	if(n==0)
+		return 0;
+	
+	if(diff==0)
+	{
+		//If diff=0 then this ele. has to become an asst. for the upcoming captains
+		return dp[n][diff]=asst[0]+func(n-1,cap+1,asst+1,1);
+	}
+	if(diff==n)
+	{
+		//If diff=n then this ele. has to become a captain. for the extra assistants
+		return dp[n][diff]=cap[0]+func(n-1,cap+1,asst+1,diff-1);
+	}
+	else
+	{
+		int op1=asst[0]+func(n-1,cap+1,asst+1,diff+1);
+		int op2=cap[0]+func(n-1,cap+1,asst+1,diff-1);
+		return dp[n][diff]=min(op1,op2);
+	}
+	
+}
+
+void solve()
+{
+	int n;
+	cin>>n;
+
+	int*cap=new int[n];
+	int*asst=new int[n];
+
+	for(int i=0; i<n; i++)
+	{
+		cin>>cap[i]>>asst[i];
+	}
+
+	memset(dp,-1,sizeof(dp));
+
+	int ans = func(n,cap,asst,0);
+	cout << ans;
+	
+}
+
+int main()
+{
+	std::ios::sync_with_stdio(false);
+
+	#ifndef ONLINE_JUDGE
+	freopen("input.txt","r",stdin);
+	freopen("output.txt","w",stdout);
+	#endif
+
+	int t=1;
+	//cin>>t;
+	while(t--)
+	{
+		solve();
+	}
+    return 0;
+}

Dynamic Programming/(SPOJ)PARTY.cpp

@@ -0,0 +1,104 @@
+//Author: rishab1128
+
+#include<bits/stdc++.h>
+using namespace std;
+
+#define FF         first
+#define SS         second
+#define PB         push_back
+#define PF         push_front
+#define MP         make_pair
+
+pair<int,int> knapsack2(int* weights, int* values, int n, int maxWeight)
+{
+	int DP[n+1][maxWeight+1];
+
+	//Filling 0th row and 0th col
+	for(int w=0; w<=maxWeight; w++)
+	{
+		DP[0][w]=0;
+	}
+	for(int i=0; i<=n; i++)
+	{
+		DP[i][0]=0;
+	}
+
+	int Weights[n+1],Values[n+1],j=1,k=1;
+	for(int i=0; i<n; i++)
+	{
+		Weights[j]=weights[i];
+		j++;
+	}
+
+	for(int i=0; i<n; i++)
+	{
+		Values[k]=values[i];
+		k++;
+	}
+
+	for(int i=1; i<=n; i++)
+	{
+		for(int w=1; w<=maxWeight; w++)
+		{
+			if(Weights[i]<=w)			
+				DP[i][w]=max(DP[i-1][w],DP[i-1][w-Weights[i]]+Values[i]);			
+			else
+				DP[i][w]=DP[i-1][w];
+		}
+	}
+
+	int maxvalue=DP[n][maxWeight];
+	int minweight=0;
+	for(int i=0;i<=maxWeight;i++)
+	{
+		if(DP[n][i]==maxvalue)
+		{
+			minweight=i;
+			break;
+		}
+	}
+
+	return {minweight,maxvalue};
+}
+
+void solve()
+{
+	while(1)
+	{
+		int budget,n;
+		cin>>budget>>n;
+
+		if(budget==0&&n==0)
+			return;
+
+		int*fee=new int[n];
+		int*fun=new int[n];
+
+		for(int i=0; i<n; i++)
+		{
+			cin>>fee[i]>>fun[i];
+		}
+
+		cout<<knapsack2(fee,fun,n,budget).FF<<" "<<knapsack2(fee,fun,n,budget).SS<<endl;
+
+	}
+
+}
+
+int main()
+{
+	std::ios::sync_with_stdio(false);
+
+	#ifndef ONLINE_JUDGE
+	freopen("input.txt","r",stdin);
+	freopen("output.txt","w",stdout);
+	#endif
+
+	int t=1;
+	//cin>>t;
+	while(t--)
+	{
+		solve();
+	}
+    return 0;
+}