1723 Find Minimum Time to Finish All Jobs 42.0% Hard 1724 Checking Existence of Edge Length Limited Paths II 54.1% Hard 1725 Number Of Rectangles That Can Form The Largest Square Go 78.7% Easy 1726 Tuple with Same Product 59.9% Medium 1727 Largest Submatrix With Rearrangements 59.8% Medi...
INDUCTOR(1055P-101) INDUCTOR(2520)56NH INDUCTOR(4.7UH)CL321611T-4R7KP INDUCTOR(47UH)NL322522T-470KPB INDUCTOR(DLCB1260-1R4101) INDUCTOR(SH1870-900_90UH) INDUCTOR(SH4532-221_F2?) INDUCTOR(SH6244-150_15UH) INDUCTOR(SH7850-330_33UH) INDUCTOR-0603-CHI1608-R12K-0 INDUCTOR...
1697 Checking Existence of Edge Length Limited Paths 56.4% Hard 1698 Number of Distinct Substrings in a String 55.4% Medium 1699 Number of Calls Between Two Persons 85.2% Medium 1700 Number of Students Unable to Eat Lunch 69.9% Easy 1701 Average Waiting Time 61.4% Medium 1702 Maximum ...
1724 Checking Existence of Edge Length Limited Paths II 51.3% Hard 1725 Number Of Rectangles That Can Form The Largest Square Go 78.7% Easy 1726 Tuple with Same Product 60.7% Medium 1727 Largest Submatrix With Rearrangements 60.8% Medium 1728 Cat and Mouse II 40.5% Hard 1729 Find Follo...
12. Ford-Fulkerson 算法(最大网络流增广路)13. Edmonds-Karp 算法(最大网络流)14. Dinic 算法(最大网络流)15. 一般预流推进算法16. 最高标号预流推进 HLPP 算法17. Primal-Dual 原始对偶算法(最小费用流)18. Kosaraju 算法(有向图强连通分量)19. Tarjan 算法(有向图强连通分量)20. Gabow 算法(有向图...
1724 Checking Existence of Edge Length Limited Paths II 58.0% Hard 1725 Number Of Rectangles That Can Form The Largest Square Go 78.0% Easy 1726 Tuple with Same Product 56.7% Medium 1727 Largest Submatrix With Rearrangements 58.8% Medium 1728 Cat and Mouse II 41.0% Hard 1729 Find Follo...
1697 Checking Existence of Edge Length Limited Paths 49.2% Hard 1698 Number of Distinct Substrings in a String 61.7% Medium 1699 Number of Calls Between Two Persons 85.9% Medium 1700 Number of Students Unable to Eat Lunch Go 67.7% Easy 1701 Average Waiting Time 61.9% Medium 1702 Maxim...
7. Bellman-Ford 算法(单源最短路径)8. SPFA 算法(单源最短路径)9. Floyd 算法(多源最短路径)10. Johnson 算法(多源最短路径)11. Fleury 算法(欧拉回路)12. Ford-Fulkerson 算法(最大网络流增广路)13. Edmonds-Karp 算法(最大网络流)14. Dinic 算法(最大网络流)15. 一般预流推进算法16. 最高标号...
2374 Node With Highest Edge Score 45.6% Medium 2375 Construct Smallest Number From DI String 73.3% Medium 2376 Count Special Integers 35.7% Hard 2377 Sort the Olympic Table 80.9% Easy 2378 Choose Edges to Maximize Score in a Tree 64.8% Medium 2379 Minimum Rec...
1724 Checking Existence of Edge Length Limited Paths II 59.5% Hard 1725 Number Of Rectangles That Can Form The Largest Square 77.3% Easy 1726 Tuple with Same Product 54.1% Medium 1727 Largest Submatrix With Rearrangements 57.8% Medium 1728 Cat and Mouse II 40.5% Hard 1729 Find Followers...