|Double Ended Queue|== user(user="pauldb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Heapuri|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|APM|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Arbore partial de cost minim|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Componente tare conexe|== user(user="marius" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Componente biconexe|== user(user="marius" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|== user(user="marius" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

|Invers modular|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Paduri de multimi disjuncte|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|

In tabelul de mai jos se afla sugestii privind algoritmii care trebuie sa se gaseasca sub forma de probleme in arhiva educationala.
Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":forum/index.php?topic=2753.msg22505#new!

In tabelul de mai jos se afla sugestii privind algoritmii care trebuie sa se gaseasca sub forma de probleme in arhiva educationala. Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":forum/index.php?topic=2753.msg22505#new!
*Paul*: Ar trebui facut un topic nou pentru asta. Nu am timp acuma. Postul de deschidere trebuie sa fie foarte clar si la subiect.

_Matematica:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Algoritmul lui Euclid':problema/euclid2|== user(user="filipb" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Algoritmul lui Euclid extins':problema/euclid3|== user(user="Bogdan2412" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Ciurul lui Erathostenes':problema/ciur|== user(user="filipb" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Algoritmul lui Gauss|-|-|==Stars(rating="0" scale="1" type="small")==|
|Principiul includerii si excluderii|-|-|==Stars(rating="0" scale="1" type="small")==|
 
_Backtracking:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Permutari':problema/permutari|== user(user="CezarMocan" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Combinari':problema/combinari|== user(user="CezarMocan" type="tiny") ==|== user(user="wefgef" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Submultimi|== user(user="CezarMocan" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
 
_Programare dinamica:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Cel mai lung subsir comun':problema/cmlsc|== user(user="filipb" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Cel mai lung subsir crescator':problema/scmax|== user(user="Florian" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Knapsack|== user(user="gabitzish1" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Subsecventa de suma maxima|== user(user="GavrilaVlad" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
 
_Algoritmi pe grafuri:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Parcurgere BFS|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Parcurgere DFS - componente conexe':problema/dfs|== user(user="gabitzish1" type="tiny") ==|== user(user="DitzoneC" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Componente biconexe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|== user(user="Tabara" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|'Sortare topologica':problema/sortaret|== user(user="Tabara" type="tiny") ==|== user(user="DitzoneC" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Lant hamiltonian|-|-|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbore partial de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Algoritmul lui Dijkstra':problema/dijkstra|== user(user="Dastas" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Algoritmul Floyd-Warshall/Roy-Floyd':problema/royfloyd|== user(user="gabitzish1" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Algoritmul Bellman-Ford|-|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim|== user(user="fireatmyself" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|-|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|Lowest Common Ancestor|== user(user="devilkind" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|2SAT|-|-|==Stars(rating="0" scale="1" type="small")==|
 
_Siruri de caractere:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Potrivirea sirurilor':problema/strmatch|== user(user="Bogdan2412" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de sufixe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|-|-|==Stars(rating="0" scale="1" type="small")==|
 
_Structuri de date:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Heapuri|== user(user="floringh06" type="tiny") ==|== user(user="astronomy" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Hashuri|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Arbori de intervale':problema/arbint|== user(user="cos_min" type="tiny") ==|== user(user="Ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de intervale aplicatie 1|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 2|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 3|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 4|-|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmi {$O(sqrtN)$}|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Arbori indexati binar':problema/aib|== user(user="cos_min" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Range Minimum Query':problema/rmq|== user(user="devilkind" type="tiny") ==|== user(user="ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Double ended queue (deque)|-|-|==Stars(rating="0" scale="1" type="small")==|
|Structuri de multimi disjuncte|== user(user="tm_radu" type="tiny")==|== user(user="astronomy" type="tiny")==|==Stars(rating="0" scale="1" type="small")==|
|Treapuri|== user(user="Bogdan2412" type="tiny") ==|== user(user="domino" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
 
_Geometrie:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Intersectia a doua drepte|-|-|==Stars(rating="0" scale="1" type="small")==|
|Aria unui poligon|-|-|==Stars(rating="0" scale="1" type="small")==|
|Punct in poligon|-|-|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|-|-|==Stars(rating="0" scale="1" type="small")==|
|Diagrame Voronoi|-|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta minima intre doua puncte in plan|-|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta maxima intre doua puncte in plan|-|-|==Stars(rating="0" scale="1" type="small")==|
 
_Diverse:_
 
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Cautare binara':problema/cautbin|== user(user="toni2007" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Ridicare la putere in timp logaritmic':problema/lgput|== user(user="tudalex" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Evaluare de expresii':problema/evaluare|== user(user="sima_cotizo" type="tiny") ==|== user(user="Ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Sprague-Grundy(Teoria jocurilor)|-|-|==Stars(rating="0" scale="1" type="small")==|
|Statistici de ordine|-|-|==Stars(rating="0" scale="1" type="small")==|
|Operatii pe numere mari|== user(user="savim" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|

table(example). |_. Denumire problema|_. Categoria|
|Algoritmul lui Gauss|Matematica|
|Principiul includerii si excluderii|Matematica|
|Submultimi|Backtracking|
|Knapsack|Programare dinamica|
|Subsecventa de suma maxima|Programare dinamica|
|Lant hamiltonian|Algoritmi pe grafuri|
|Algoritmul Bellman-Ford|Algoritmi pe grafuri|
|Cuplaj maxim de cost minim|Algoritmi pe grafuri|
|Lowest Common Ancestor|Algoritmi pe grafuri|
|2SAT|Algoritmi pe grafuri|
|Siruri de sufixe|Siruri de caractere|
|Arbori de sufixe|Siruri de caractere|
|Arbori de intervale aplicatie 1|Structuri de date|
|Arbori de intervale aplicatie 2|Structuri de date|
|Arbori de intervale aplicatie 3|Structuri de date|
|Arbori de intervale aplicatie 4|Structuri de date|
|Algoritmi {$O(sqrtN)$}|Structuri de date|
|Treapuri|Structuri de date|
|Intersectia a doua drepte|Geometrie|
|Aria unui poligon|Geometrie|
|Punct in poligon|Geometrie|
|Diagrame Voronoi|Geometrie|
|Distanta minima intre doua puncte in plan|Geometrie|
|Distanta maxima intre doua puncte in plan|Geometrie|
|Sprague-Grundy|Jocuri|
|Statistici de ordine|Diverse|
|Operatii pe numere mari|Diverse|