QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#449362#323. HillssabagoduadzeCompile Error//C++23812b2024-06-21 02:32:272024-06-21 02:32:27

Judging History

你现在查看的是最新测评结果

  • [2024-06-21 02:32:27]
  • 评测
  • [2024-06-21 02:32:27]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int N=5e3+5;
int n,a[N],dp[N][N][3];
signed main(){
	cin>>n; a[0]=a[n+1]=-1e9;
	for (int i=0; i<=n; i++)
		for (int j=0; j<=n; j++)
			dp[i][j][0]=dp[i][j][1]=dp[i][j][2]=1e9;
	dp[0][0][0]=0;
	for (int i=1; i<=n; i++){
		cin>>a[i];
		for (int j=0; j<=(i+1)/2; j++){
			dp[i][j][0]=min(dp[i-1][j][0],dp[i-1][j][2]);
			if (j>0) dp[i][j][1]=dp[i-1][j-1][0]+max(0ll,a[i-1]-a[i]+1);
			if (i>2 && j>0) dp[i][j][1]=min(dp[i][j][1],dp[i-1][j-1][2]+max(0ll,min(a[i-2]-1,a[i-1])-a[i]+1));
			if (j>0) dp[i][j][2]=dp[i-1][j][1]+max(0ll,a[i]-a[i-1]+1);
			//cout<<i<<" "<<j<<"-->\n";
			//cout<<dp[i][j][0]<<" "<<dp[i][j][1]<<" "<<dp[i][j][2]<<"\n";
		}
	}
	for (int i=1; i<=(n+1)/2; i++)
		cout<<min({dp[n][i][0],dp[n][i][1],dp[n][i][2]})<<" ";
}

详细

answer.code: In function ‘int main()’:
answer.code:15:65: error: no matching function for call to ‘max(long long int, int)’
   15 |                         if (j>0) dp[i][j][1]=dp[i-1][j-1][0]+max(0ll,a[i-1]-a[i]+1);
      |                                                              ~~~^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from answer.code:1:
/usr/include/c++/13/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++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
answer.code:15:65: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘int’)
   15 |                         if (j>0) dp[i][j][1]=dp[i-1][j-1][0]+max(0ll,a[i-1]-a[i]+1);
      |                                                              ~~~^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/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++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
answer.code:15:65: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘int’)
   15 |                         if (j>0) dp[i][j][1]=dp[i-1][j-1][0]+max(0ll,a[i-1]-a[i]+1);
      |                                                              ~~~^~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: ‘template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)’
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
answer.code:15:65: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long long int’
   15 |                         if (j>0) dp[i][j][1]=dp[i-1][j-1][0]+max(0ll,a[i-1]-a[i]+1);
      |                                                              ~~~^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: ‘template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)’
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
answer.code:15:65: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long long int’
   15 |                         if (j>0) dp[i][j][1]=dp[i-1][j-1][0]+max(0ll,a[i-1]-a[i]+1);
      |                                                              ~~~^~~~~~~~~~~~~~~~~~~
answer.code:16:88: error: no matching function for call to ‘max(long long int, int)’
   16 |                         if (i>2 && j>0) dp[i][j][1]=min(dp[i][j][1],dp[i-1][j-1][2]+max(0ll,min(a[i-2]-1,a[i-1])-a[i]+1));
      |                                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/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++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
answer.code:16:88: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘int’)
   16 |                         if (i>2 && j>0) dp[i][j][1]=min(dp[i][j][1],dp[i-1][j-1][2]+max(0ll,min(a[i-2]-1,a[i-1])-a[i]+1));
      |                                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/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++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
answer.code:16:88: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘int’)
   16 |                         if (i>2 && j>0) dp[i][j][1]=min(dp[i][j][1],dp[i-1][j-1][2]+max(0ll,min(a[i-2]-1,a[i-1])-a[i]+1));
      |                                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: ‘template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)’
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
answer.code:16:88:...