雲圖說|雲資料庫RDS跨區域備份
阿新 • • 發佈:2022-05-06
// Problem: P1434 [SHOI2002]滑雪 // Contest: Luogu // URL: https://www.luogu.com.cn/problem/P1434 // Memory Limit: 125 MB // Time Limit: 1000 ms // User: Pannnn #include <bits/stdc++.h> using namespace std; template<class T> void debugVector(const T &a) { cout << "[ "; for (size_t i = 0; i < a.size(); ++i) { cout << a[i] << (i == a.size() - 1 ? " " : ", "); } cout << "]" << endl; } template<class T1, class T2> void debugVectorPair(const vector<pair<T1, T2>> &a) { cout << "{"; for (size_t i = 0; i < a.size(); ++i) { cout << "[ " << a[i].first << ": " << a[i].second << (i == a.size() - 1 ? " ]" : " ], "); } cout << "}" << endl; } template<class T> void debugMatrix2(const T &a) { for (size_t i = 0; i < a.size(); ++i) { debugVector(a[i]); } } template<class T> using matrix2 = vector<vector<T>>; template<class T> vector<vector<T>> getMatrix2(size_t n, size_t m, T init = T()) { return vector<vector<T>>(n, vector<T>(m, init)); } template<class T> using matrix3 = vector<vector<vector<T>>>; template<class T> vector<vector<vector<T>>> getMatrix3(size_t x, size_t y, size_t z, T init = T()) { return vector<vector<vector<T>>>(x, vector<vector<T>>(y, vector<T>(z, init))); } vector<int> genBigInteger(const string &a) { vector<int> res; if (a.empty()) return res; for (int i = a.size() - 1; i >= 0; --i) { res.push_back(a[i] - '0'); } return res; } ostream &printBigInteger(const vector<int> &a) { if (a.empty()) return cout; for (int i = a.size() - 1; i >= 0; --i) { cout << a[i]; } return cout; } vector<int> maxBigInteger(const vector<int> &a, const vector<int> &b) { if (a.size() > b.size()) { return a; } else if (a.size() < b.size()) { return b; } for (int i = a.size() - 1; i >= 0; --i) { if (a[i] > b[i]) { return a; } else if (a[i] < b[i]) { return b; } } return a; } vector<int> addBigInteger(const vector<int> &a, const vector<int> &b) { vector<int> res; int pre = 0; for (size_t i = 0; i < a.size() || i < b.size() || pre; ++i) { if (i < a.size()) pre += a[i]; if (i < b.size()) pre += b[i]; res.push_back(pre % 10); pre /= 10; } while (res.size() > 1 && res.back() == 0) { res.pop_back(); } return res; } vector<int> mulBigInteger(const vector<int> &a, int b) { vector<int> res; int pre = 0; for (size_t i = 0; i < a.size() || pre; ++i) { if (i < a.size()) pre += a[i] * b; res.push_back(pre % 10); pre /= 10; } while (res.size() > 1 && res.back() == 0) { res.pop_back(); } return res; } vector<int> divBigInteger(const vector<int> &a, int b, int &r) { vector<int> res; for (int i = a.size() - 1; i >= 0; --i) { r = 10 * r + a[i]; res.push_back(r / b); r %= b; } reverse(res.begin(), res.end()); while (res.size() > 1 && res.back() == 0) { res.pop_back(); } return res; } struct Node { int i; int j; int num; }; bool compare(Node n1, Node n2) { if (n1.num < n2.num) { return true; } else { return false; } } int main() { ios::sync_with_stdio(false); cin.tie(0); int r, c; cin >> r >> c; matrix2<int> info = getMatrix2(r + 2, c + 2, 0); matrix2<int> res = getMatrix2(r + 2, c + 2, 0); vector<Node> queue; for (int i = 1; i <= r; ++i) { for (int j = 1; j <= c; ++j) { cin >> info[i][j]; queue.push_back({i, j, info[i][j]}); } } sort(queue.begin(), queue.end(), compare); int dx[] = {-1, 0, 1, 0}; int dy[] = {0, -1, 0, 1}; int resv = 0; for (int i = 0; i < queue.size(); ++i) { int x = queue[i].i; int y = queue[i].j; int maxv = 0; for (int j = 0; j < 4; ++j) { if (info[x + dx[j]][y + dy[j]] >= queue[i].num) { continue; } maxv = max(maxv, res[x + dx[j]][y + dy[j]]); } res[x][y] = maxv + 1; resv = max(resv, res[x][y]); } cout << resv << endl; return 0; }