Heavy-light decomposition, O(log2n) amortized analysis of link-cut trees, min cost max flow, min cost circulation, shortest augmenting paths.
Advanced, algorithm, Computer, science, harvard,
1:20:15
amirnmt 1106 مشاهده
1:26:03
amirnmt 1212 مشاهده
1:26:14
amirnmt 1013 مشاهده
1:25:40
amirnmt 1003 مشاهده
1:27:51
amirnmt 911 مشاهده
14:47
siavash533 1085 مشاهده
1:16:32
daha 1190 مشاهده