Я не мог поймать идею алгоритма
https://www.hackerrank.com/challenges/mr-k-marsh/forum
int kMarsh(int m, int n, const vector& grid) {
int longest = 0;
vector verticalx(m+1, vector(n+1));
for (int i=1; i > n;
for (int i=1; i > temp;
grid.push_back(temp);
}
int longest = kMarsh(m, n, grid);
if (longest != 0) cout
Подробнее здесь: https://stackoverflow.com/questions/794 ... -algorithm
