Language: C++

#include <iostream>
#include <vector>
#include <algorithm> 
#include <cmath> //pow

#define rep0(i,n) for(int (i) = 0; (i) < (n); (i)++)
#define rep1(i,n) for(int (i) = 1; (i) <= (n); (i)++)

using namespace std;

int main(void) {
	int n;
	cin >> n;

	vector<long long int> t(n + 1), v(n + 2);

	t[0] = 0;
	rep1(i, n) cin >> t[i];
	v[0] = 0; v[n + 1] = 0;
	rep1(i, n) cin >> v[i];

	vector<long long int> left(n + 1), right(n + 1);
	left[1] = 0; right[n] = 0;

	rep1(i, n) left[i + 1] = min(left[i] + t[i], v[i]);
	rep1(i, n) right[n - i] = min(right[n - i + 1] + t[n - i + 1], v[n - i + 1]);

	rep1(i, n - 1) {
		left[i + 1] = right[i] = min(right[i], left[i + 1]);
	}

	long double ans = 0;
	rep1(i, n) {
		long long int x = abs(left[i] - right[i]);
		ans += min(left[i], right[i]) * t[i] + (t[i] + x) * (t[i] + x) / 4.0 - x * x / 2.0 - pow(max(t[i] - (v[i] - left[i]) - (v[i] - right[i]), 0), 2) / 4.0;
	}
	cout << ans << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:35:109: error: no matching function for call to 'max(__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type, int)'
   35 |                 ans += min(left[i], right[i]) * t[i] + (t[i] + x) * (t[i] + x) / 4.0 - x * x / 2.0 - pow(max(t[i] - (v[i] - left[i]) - (v[i] - right[i]), 0), 2) / 4.0;
      |                                                                                                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:35:109: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   35 |                 ans += min(left[i], right[i]) * t[i] + (t[i] + x) * (t[i] + x) / 4.0 - x * x / 2.0 - pow(max(t[i] - (v[i] - left[i]) - (v[i] - right[i]), 0), 2) / 4.0;
      |                                                                                                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:3:
/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:35:109: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   35 |                 ans += min(left[i], right[i]) * t[i] + (t[i] + x) * (t[i] + x) / 4.0 - x * x / 2.0 - pow(max(t[i] - (v[i] - left[i]) - (v[i] - right[i]), 0), 2) / 4.0;
      |                                                                                                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~