nthu-cp / nthu-cpp Goto Github PK
View Code? Open in Web Editor NEW前人種樹,後人持久化🌴
Home Page: https://nthu-cp.github.io/NTHU-CPP/
前人種樹,後人持久化🌴
Home Page: https://nthu-cp.github.io/NTHU-CPP/
https://tioj.ck.tp.edu.tw/uploads/attachment/11/54/7.pdf
https://slides.com/kevin_zhang/deck-8c1c8e/
http://www.chino.taipei/code-2016-0402Algorithm-DP優化之四邊形不等式優化/
http://pisces.ck.tp.edu.tw/~peng/index.php?action=showfile&file=f4c79992d9e0b5ee4aa9fd7db9115c673b2cf6150
http://momo-funnycodes.blogspot.com/2012/06/tioj-1449-extreme.html
https://cp-algorithms.com/dynamic_programming/knuth-optimization.html
https://oi-wiki.org/dp/opt/quadrangle/
https://core.ac.uk/download/pdf/82676028.pdf
BIT
(a.k.a. Fenwick tree)In fact, there are few online resources that is mainly focused on inversions :(
https://codeforces.com/problemset/problem/535/D
https://codeforces.com/problemset/problem/471/D
https://codeforces.com/contest/432/problem/D
https://cp-algorithms.com/string/prefix-function.html
https://oi-wiki.org/string/kmp/
https://www.geeksforgeeks.org/remove-all-occurrences-of-string-t-in-string-s-using-kmp-algorithm/?ref=rp
https://labuladong.gitbook.io/algo-en/i.-dynamic-programming/kmpcharactermatchingalgorithmindynamicprogramming#i.-overview-of-kmp-algorithm
As title.
//Definition of Binary Search Tree, Heap, and Treap
//How it keep self to balance
//Create a Treap node
//Merge two Treap nodes
//according to node's key split it to two nodes
//Split by size, save information in Treap node, pull (merge two nodes and update information)
//how to push Treap node's lazy tag to node's son
//use lazy tag to reverse
//introduction to cartesian tree
//some problems use treap will be better or only can use treap to solve it
//for example: TIOJ 1169, cf 702F
https://codeforces.com/blog/entry/84017
https://oi-wiki.org/ds/treap/
https://oi-wiki.org/ds/cartesian-tree/
https://cp-algorithms.com/data_structures/treap.html
https://usaco.guide/adv/treaps?lang=cpp
//sorry for my poor English :(
Outline:
說明斜率優化觀念、使用 deque
使用二分搜
/*
以上每個部分都有:
*/
Add this chapter under Greedy.
https://oi-wiki.org/ds/persistent-seg/
https://tioj.ck.tp.edu.tw/problems/1827
https://www.luogu.com.cn/problem/P2617
https://www.luogu.com.cn/problem/P2633
Outlines are as the following comments
Introduction to Dynamic Programming on Trees [1]
DP on Trees with Rerooting [12]
DP on trees with
Related Topics
(will use a few sentences to show how they are related, and links to other NTHU-CPP pages in the future)
References
Reference
https://www.luogu.com.cn/problem/P3389
https://www.luogu.com.cn/problem/P4035
https://www.luogu.com.cn/problem/P2973
https://lightoj.com/problem/graph-coloring
https://www.spoj.com/problems/XMAX/
https://codeforces.com/contest/167/problem/E
https://codeforces.com/problemset/problem/1411/G
http://e-maxx.ru/algo/linear_systems_gauss
https://cp-algorithms.com/linear_algebra/linear-system-gauss.html
https://oi-wiki.org/math/linear-algebra/gauss/
https://codeforces.com/blog/entry/65787
https://github.com/jaehyunp/stanfordacm/blob/master/code/ReducedRowEchelonForm.cc
Introduce to Heavy Light Decomposition
Properties
Implementation
Prove the time complexity
Problems
Reference
Make arithmetic_function.md complete.
NTHU-CPP 有許多不錯的資訊,但這些文章均未被 google 索引 (可搜尋 site:https://nthu-cp.github.io
)。透過生成 sitemap.xml
並提交到 search console 可以讓 google 的機器人更了解網站的架構,增加文章被索引的速度 (可以參考google 的官方說明)。
https://oi-wiki.org/ds/lct/
http://sunmoon-template.blogspot.com/2015/11/link-cut-tree.html
https://codeforces.com/blog/entry/80383
https://github.com/enkerewpo/OI-Public-Library/blob/master/%E6%95%B0%E6%8D%AE%E7%BB%93%E6%9E%84%20DATA%20STRUCTURE/Link%20Cut%20Trees.pdf
Generating Function
References
A declarative, efficient, and flexible JavaScript library for building user interfaces.
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google ❤️ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.