Language: C++

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define all(x) (x).begin(),(x).end()
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
using Graph = vector<vector<int>>;
const double pi=acos(-1);
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<MOD>;
vector<bool> seen,finished;
int pos = -1;
int ca=0;
int f=0;
void dfs(const Graph &G, int v, int p) {
    seen[v] = true;
    for (auto nv : G[v]) {
        if (nv == p) continue;
        if (finished[nv]) continue;
      if (seen[nv] && !finished[nv]) {
            pos = nv;f++; 
            return;
        }
      dfs(G, nv, v);
 
        // サイクル検出したならば真っ直ぐに抜けていく
        if (pos != -1) {
        return;}}
      finished[v] = true;
}
    
mint calc(long long N, long long K) {
    mint res = 1;
    for (long long n = 0; n < K; ++n) {
        res *= (N - n);
        res /= (n + 1);
    }
    return res;
}
struct UnionFind {
    vector<ll> par; // par[i]:iの親の番号　(例) par[3] = 2 : 3の親が2
 
    UnionFind(ll N) : par(N) { //最初は全てが根であるとして初期化
        for(ll i = 0; i < N; i++) par[i] = i;
    }
 
    ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }
 
    void unite(ll x, ll y) { // xとyの木を併合
        ll rx = root(x); //xの根をrx
        ll ry = root(y); //yの根をry
        if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま
        par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
    }
 
    bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
        ll rx = root(x);
        ll ry = root(y);
        return rx == ry;
    }
};
ll modpow(ll a, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

// a^{-1} mod を計算する
ll modinv(ll a, ll mod) {
    return modpow(a, mod - 2, mod);
}
int main(){
ll h,w,k; cin>>h>>w>>k;
ll fi[h+1][w+1]={};
  rep(i,k){
    ll x,y,v; cin>>x>>y>>v;
    x; y;
    fi[y][x]=v;}
ll dp[3005][3005][5]={};
  rep(i,w){
    rep(j,h){
      rep(k,4){
        if(fi[j][i]>0){
          dp[j][i][k+1]=chmax(dp[j][i-1][k]);
          dp[j][i][k]=chmax(dp[j][i-1][k]);
          dp[j][i][1]=chmax(dp[j-1][i][0]);
          dp[j][i][0]=chmax(dp[j-1][i][0]);
        }
        else{
          dp[j][i][k]=chmax(dp[j-1][i][k]);
          dp[j][i][k]=chmax(dp[j][i-1][k]);
        }
      }
    }
  }
  ll ans = 0;
  rep(i,4){
    ans = max(ans,dp[h][w][i];}
  cout << dp[h][w][3] << endl;}  

Compiler output:
a.cc: In function 'int main()':
a.cc:161:30: error: no matching function for call to 'chmax(ll&)'
  161 |           dp[j][i][k+1]=chmax(dp[j][i-1][k]);
      |                         ~~~~~^~~~~~~~~~~~~~~
a.cc:4:31: note: candidate: 'template<class T> bool chmax(T&, T)'
    4 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:4:31: note:   candidate expects 2 arguments, 1 provided
a.cc:162:28: error: no matching function for call to 'chmax(ll&)'
  162 |           dp[j][i][k]=chmax(dp[j][i-1][k]);
      |                       ~~~~~^~~~~~~~~~~~~~~
a.cc:4:31: note: candidate: 'template<class T> bool chmax(T&, T)'
    4 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:4:31: note:   candidate expects 2 arguments, 1 provided
a.cc:163:28: error: no matching function for call to 'chmax(ll&)'
  163 |           dp[j][i][1]=chmax(dp[j-1][i][0]);
      |                       ~~~~~^~~~~~~~~~~~~~~
a.cc:4:31: note: candidate: 'template<class T> bool chmax(T&, T)'
    4 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:4:31: note:   candidate expects 2 arguments, 1 provided
a.cc:164:28: error: no matching function for call to 'chmax(ll&)'
  164 |           dp[j][i][0]=chmax(dp[j-1][i][0]);
      |                       ~~~~~^~~~~~~~~~~~~~~
a.cc:4:31: note: candidate: 'template<class T> bool chmax(T&, T)'
    4 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:4:31: note:   candidate expects 2 arguments, 1 provided
a.cc:167:28: error: no matching function for call to 'chmax(ll&)'
  167 |           dp[j][i][k]=chmax(dp[j-1][i][k]);
      |                       ~~~~~^~~~~~~~~~~~~~~
a.cc:4:31: note: candidate: 'template<class T> bool chmax(T&, T)'
    4 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:4:31: note:   candidate expects 2 arguments, 1 provided
a.cc:168:28: error: no matching function for call to 'chmax(ll&)'
  168 |           dp[j][i][k]=chmax(dp[j][i-1][k]);
      |                       ~~~~~^~~~~~~~~~~~~~~
a.cc:4:31: note: candidate: 'template<class T> bool chmax(T&, T)'
    4 | template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
      |                               ^~~~~
a.cc:4:31: note:   candidate expects 2 arguments, 1 provided
a.cc:175:30: error: expected ')' before ';' token
  175 |     ans = max(ans,dp[h][w][i];}
      |              ~               ^
      |                              )