Language: C++

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <queue>
#include <string>
#include <iomanip>
#include <stdio.h>
#include <cstring>
#include <random>
#include <chrono>
#include <bitset>
#include <fstream>
#include <sstream>

using namespace std;

typedef long long ll;
typedef long double ld;

ll big = 1000000007ll;
float likeabutterfly;
string likeabee;
ll n,m,q,h,k,w;
ll T;

ll M[500][500] = {0};

ll DP[301][301] = {0};

vector<vector<ll> > C1(301 , vector<ll>());
vector<vector<ll> > C2(301 , vector<ll>());

ll dp(ll i, ll j){

if(i == n || j == n)return 0;

if(DP[i][j] != -1){return DP[i][j];}
ll fric = 0;

for(ll c1 = max(0,j-i); c1 < n-i; c1++){

    ll i2 = c1;
    ll j2 = c1+j-i;

    if(j2 >= 0 && j2 < n){
        if(M[i2][k] == M[j2][k+1]){fric++;}

    }
}

ll ans = fric + min(dp(i+1,j) , dp(i,j+1));
DP[i][j] = ans;
return ans;
}

int main()
{
    ll c1,c2,c3,c4,c5,c6;
    ll a,b,d,e,g,c;
    ll x,y,z;
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);

    cin >> n >> m;

    for(c1 = 0; c1 < n; c1++){
        string s;
        cin >> s;
        for(c2 = 0; c2 < m; c2++){
           M[c1][c2] = ll(s[c2])-97;

        }
    }

ll ans = 0;

    for(c2 = 0; c2 < m-1; c2++){


        for(c1 = 0; c1 < 301; c1++){
            for(c3 = 0; c3 < 301; c3++){
                DP[c1][c3] = -1;
            }
        }

    
       
    
    
        k = c2;
        ans += dp(0,0);

    }




        cout << ans << "\n";

	return 0;
}


Compiler output:
a.cc: In function 'll dp(ll, ll)':
a.cc:45:16: error: no matching function for call to 'max(int, ll)'
   45 | for(ll c1 = max(0,j-i); c1 < n-i; c1++){
      |             ~~~^~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:45:16: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'll' {aka 'long long int'})
   45 | for(ll c1 = max(0,j-i); c1 < n-i; c1++){
      |             ~~~^~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:2:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:45:16: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   45 | for(ll c1 = max(0,j-i); c1 < n-i; c1++){
      |             ~~~^~~~~~~