Rezumat problemă

DifMax

#2220

Se consideră un șir a[1], a[2], …, a[n] de numere întregi. Să se determine diferența maximă de forma a[i] - a[j], unde 1 ≤ i < j ≤ n.

-

Consola Pracsiu Dan (dnprx) Dan Pracsiu medie

Clasa 9 Tablouri unidimensionale (vectori) Parcurgerea vectorilor Sume parțiale

Rezolvă

Detalii

Problema	DifMax	Operații I/O	tastatură/ecran
Limita timp	0.15 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64477915	Utilizator	Deonise Alex (AlexDeonise)
Fișier	difmax.cpp	Dimensiune	581 B
Data încărcării	09 Mai 2026, 17:15	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

difmax.cpp: In function ‘int main()’:
difmax.cpp:22:21: error: no matching function for call to ‘max(long long int&, int)’
   22 |         difmax = max(difmax, maxim[i] - minim[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 difmax.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: ‘template<class _Tp> 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:
difmax.cpp:22:21: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘int’)
   22 |         difmax = max(difmax, maxim[i] - minim[i + 1]);
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: ‘template<class _Tp, class _Compare> 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:
difmax.cpp:22:21: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘int’)
   22 |         difmax = max(difmax, maxim[i] - minim[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> _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:
difmax.cpp:22:21: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long long int’
   22 |         difmax = max(difmax, maxim[i] - minim[i + 1]);
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: ‘template<class _Tp, class _Compare> _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:
difmax.cpp:22:21: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long long int’
   22 |         difmax = max(difmax, maxim[i] - minim[i + 1]);
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
difmax.cpp:6:15: warning: unused variable ‘j’ [-Wunused-variable]
    6 |     int n, i, j, a[100001], maxim[100001], minim[100001];
      |               ^

Cum funcționează evaluarea?