Rezumat problemă

SumSubMax

#651

Se dă vectorul de tați al unui arbore cu rădăcină cu n noduri. Fiecare nod al arborelui are asociată o valoare numerică întreagă. Determinați nodurile p din arbore pentru care suma valorilor asociate nodurilor din subarborele cu rădăcina în p este maximă.

Fișiere Candale Silviu (silviu) medie

Clasa 11 Teoria Grafurilor Arbori cu rădăcină

Rezolvă

Detalii

Problema	SumSubMax	Operații I/O	sumsubmax.in/sumsubmax.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64377877	Utilizator	Branea Tudor (TudorBranea)
Fișier	sumsubmax.cpp	Dimensiune	749 B
Data încărcării	04 Mai 2026, 12:30	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

sumsubmax.cpp: In function ‘void dfs(int, long long int)’:
sumsubmax.cpp:9:27: error: ‘begin’ was not declared in this scope; did you mean ‘std::begin’?
    9 |     for (int fiu : fii[nod]) {
      |                           ^
      |                           std::begin
In file included from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:166,
                 from sumsubmax.cpp:1:
/usr/include/c++/13/valarray:1238:5: note: ‘std::begin’ declared here
 1238 |     begin(const valarray<_Tp>& __va) noexcept
      |     ^~~~~
sumsubmax.cpp:9:27: error: ‘end’ was not declared in this scope; did you mean ‘std::end’?
    9 |     for (int fiu : fii[nod]) {
      |                           ^
      |                           std::end
/usr/include/c++/13/valarray:1265:5: note: ‘std::end’ declared here
 1265 |     end(const valarray<_Tp>& __va) noexcept
      |     ^~~
sumsubmax.cpp: In function ‘int main()’:
sumsubmax.cpp:33:17: error: no matching function for call to ‘max(int&, long long int&)’
   33 |         mx = max(sume[i], mx);
      |              ~~~^~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51:
/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:
sumsubmax.cpp:33:17: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘long long int’)
   33 |         mx = max(sume[i], mx);
      |              ~~~^~~~~~~~~~~~~
/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:
sumsubmax.cpp:33:17: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘long long int’)
   33 |         mx = max(sume[i], mx);
      |              ~~~^~~~~~~~~~~~~
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:
sumsubmax.cpp:33:17: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘int’
   33 |         mx = max(sume[i], mx);
      |              ~~~^~~~~~~~~~~~~
/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:
sumsubmax.cpp:33:17: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘int’
   33 |         mx = max(sume[i], mx);
      |              ~~~^~~~~~~~~~~~~
sumsubmax.cpp:39:5: error: expected primary-expression before ‘}’ token
   39 |     }
      |     ^

Cum funcționează evaluarea?