Language: C++

#include <iostream>
#include <string>
#include <string.h>
#include <algorithm>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <stdio.h>
#include <vector>
#include <time.h>
#include <iomanip>
#include <thread>
#include <atomic>
#include <mutex>
#include <future>
#define double long double
#define int long long
#define low lower_bound
#define upp upper_bound
#define mod (int)1e9+7
#define inf (int)1e16
#define rep(i,n) for (int i = 0; i < n; i++)
#define Rep(i,n) for (int i = n; i >= 0; i--)
#define all(vec) vec.begin(),vec.end()
#define vsort(vec) sort(all(vec))
#define vrever(vec) reverse(all(vec));
#define vunsort(vec) vsort(vec); vrever(vec);
#define bisea binary_search
#define cend cout<<endl;
#define P pair<int, int>
#define prique priority_queue<P, vector<P>, greater<P>>
struct edge { int to, cost; };
using namespace std;
int n;
string s[11111];
int cnt = 0;
vector<int>A, B;
bool mi = false;
signed main() {
	cin >> n;
	rep(i, n) {
		cin >> s[i];
		string a = s[i];
		int m = s[i].size();
		for (int j = 0; j < m - 1; j++) {
			if (a[j] == 'A' && a[j + 1] == 'B') cnt++;
		}
		if (a[m - 1] == 'A') A.push_back(i);
		if (a[0] == 'B') B.push_back(i);
		if (a[m - 1] == 'A' && a[0] == 'B') {
			mi = true;
		}
	}
	if (A.size() == B.size()) {
		if (mi) cout << max((int)0, A.size() + cnt - 1) << endl;
		else cout << A.size() + cnt << endl;
	}
	else {
		cout << cnt + min(A.size(), B.size()) << endl;
	}
}


Compiler output:
a.cc: In function 'int main()':
a.cc:57:36: error: no matching function for call to 'max(long long int, long long unsigned int)'
   57 |                 if (mi) cout << max((int)0, A.size() + cnt - 1) << endl;
      |                                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:57:36: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'long long unsigned int')
   57 |                 if (mi) cout << max((int)0, A.size() + cnt - 1) << endl;
      |                                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:4:
/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:57:36: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   57 |                 if (mi) cout << max((int)0, A.size() + cnt - 1) << endl;
      |                                 ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~