#include #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template inline int ssize(const T &a) { return (int) std::size(a); } template std::istream &operator>>(std::istream &is, std::vector &a) { for (auto &x: a) is >> x; return is; } template std::ostream &operator<<(std::ostream &os, const std::pair &a) { return os << "(" << a.first << ", " << a.second << ")"; } template std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template struct is_iterable : std::false_type {}; template struct is_iterable())), decltype(std::end(std::declval()))>> : std::true_type { }; template::value && !std::is_same::value && !std::is_same::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } void print() { std::cout << "\n"; } template void print(const T &x) { std::cout << x << "\n"; } template void print(const Head &head, Tail... tail) { std::cout << head << " "; print(tail...); } struct Input { template operator T() const { T x; std::cin >> x; return x; } } in; #ifdef MY_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; auto solve() { const int H = in, W = in, N = in; vector C(H, vector(W, 0)); REP(i, H) { REP(j, W) { int c = in; C[i][j] = c; } } set> intervals; REP(i, H - 1) REP(j, W) { int l = C[i][j]; int r = C[i + 1][j]; if (l == r) continue; if (l > r) swap(l, r); intervals.insert({r, l}); } REP(i, H) REP(j, W - 1) { int l = C[i][j + 1]; int r = C[i][j]; if (l == r) continue; if (l > r) swap(l, r); intervals.insert({r, l}); } DUMP(intervals); int last = -100; int cnt = 0; for (auto[r, l]: intervals) { if (l <= last) continue; cnt++; last = r - 1; } return cnt + 1; } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << std::fixed << std::setprecision(18); const int t = 1; REP(test_case, t) { auto ans = solve(); print(ans); } }