Merge pull request #433 from Aashu23/master

Gold mine problem

Author: amritansh22

GoldMineProblem.cpp

@@ -0,0 +1,51 @@
+#include<bits/stdc++.h> 
+using namespace std; 
+
+const int MAX = 100; 
+
+int getMaxGold(int gold[][MAX], int m, int n) 
+{ 
+
+	int goldTable[m][n]; 
+	memset(goldTable, 0, sizeof(goldTable)); 
+
+	for (int col=n-1; col>=0; col--) 
+	{ 
+		for (int row=0; row<m; row++) 
+		{ 
+
+			int right = (col==n-1)? 0: goldTable[row][col+1]; 
+
+
+			int right_up = (row==0 || col==n-1)? 0: 
+							goldTable[row-1][col+1]; 
+
+
+			int right_down = (row==m-1 || col==n-1)? 0: 
+							goldTable[row+1][col+1]; 
+
+
+			goldTable[row][col] = gold[row][col] + 
+							max(right, max(right_up, right_down)); 
+													
+		} 
+	} 
+
+	int res = goldTable[0][0]; 
+	for (int i=1; i<m; i++) 
+		res = max(res, goldTable[i][0]); 
+	return res; 
+} 
+
+
+int main() 
+{ 
+	int gold[MAX][MAX]= { {1, 3, 1, 5}, 
+		{2, 2, 4, 1}, 
+		{5, 0, 2, 3}, 
+		{0, 6, 1, 2} 
+	}; 
+	int m = 4, n = 4; 
+	cout << getMaxGold(gold, m, n); 
+	return 0; 
+}