Advertisement
Guest User

Untitled

a guest
Feb 23rd, 2018
73
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.42 KB | None | 0 0
  1. #include <cmath>
  2. #include <iostream>
  3. using namespace std;
  4. int n, m, matr[110][110], maxsum[110][110];
  5. int main()
  6. {
  7. cin >> n >> m;
  8. for (int i = 1; i <= n; i++)
  9. for (int j = 1; j <= m; j++)
  10. cin >> matr[i][j];
  11. maxsum[1][1] = matr[1][1];
  12. for (int i = 1; i <= n; i++)
  13. for (int j = 1; j <= m; j++)
  14. maxsum[i][j] = matr[i][j] + max(maxsum[i - 1][j], maxsum[i][j - 1]);
  15. cout << maxsum[n][m];
  16. return 0;
  17. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement