Search - oi - CodeBus

Search - oi - List

[Data structs] netstream DL : 0: 会的人并不很多的网络流算法源程序，打oi时写的-The people are not a lot of network flow algorithm source code, written when playing oi
Date : 2026-01-11 Size : 1kb User : lyy
[Data structs] noi_debug DL : 0: 程序测试机，就是专门用来测试OI竞赛的数据的，省去一个个数据的手功测试的麻烦。只要输入相应的资料便可，程序执行完后会有列表清单，告诉你对了哪些题。-Testing machine, is designed to test OI race data, save data in the hands of a reactive test trouble. Enter the appropriate information as long as can be, there will be a list of procedures after the implementation of the list and tell you what title.
Date : 2026-01-11 Size : 1kb User :
[Data structs] DD_engi DL : 0: dd牛的usaco源代码！对学习算法，oi的人很有帮助-dd cattle usaco source code! Of learning algorithm, oi the people very helpful
Date : 2026-01-11 Size : 324kb User : ysh
[Data structs] 3 DL : 0: cx lka mgewra oi arwefjasl arew awejfiwerasekjgfna-atreawoif cawektrjaingf a t oawertn gawergna lgn
Date : 2026-01-11 Size : 1kb User : chao
[Data structs] NOI1997-2005.pdf.tar DL : 0: ACM/OI资料，NOI1997-2005解题报告集合-NOI1997-2005 problem solutions
Date : 2026-01-11 Size : 245kb User : 闫凯
[Data structs] avl DL : 0: 一套持久化平衡树，可用于代替sgiSTL中的rope，且功能更加强大（略作修改可实现持久化动态树）使用GNUC++标准（在OI前辈fanhq指导下完成）文件内自带使用方法样例-A persistent balanced BST, can be used instead of rope in sgiSTL, and more powerful (slightly modified to achieve lasting dynamic tree) (OI seniors fanhq completed under the guidance) comes with sample files to use within
Date : 2026-01-11 Size : 1kb User : laoyumi
[Data structs] DP DL : 0: 随着动态规划在 OI 中的广泛运用，动态规划问题已经不再停滞于能够写出方程就能得到完美解答。如今考察我们的对于动态规划的运用往往是考察动态规划的优化，也就是降维。我们已经知道维护方程中的决策可以选择用数据结构进行优化，比如：Splay、线段树，等等。这样的优化仅能将方程的时间复杂度下降一个 LogN 的级别。如果 N 的范围相当大，即使下降一个 LogN 的级别也依然超时呢？我们引进一种更强的优化——斜率优化。-With the extensive use of dynamic programming in the OI, dynamic programming problem is no longer able to write at a standstill Equations can get the perfect answer. Today, we examine the use of dynamic programming for the study of dynamic regulation is often Optimization scheme, that is, dimension reduction. We already know that the decision to maintain the equation into the data structure can be selected Be optimized, for example: Splay, tree line, and the like. Only the next time complexity of this optimization equation Drop a LogN level. If the range of N is quite large, even if the decline in the level also remains a LogN Overtime it? We introduce a stronger optimization- slope optimization.
Date : 2026-01-11 Size : 217kb User : sxy