- Segment Tree
- BIT (Binary Indexed Tree)
- Treap
- Persistence Data Structure (Copy on write)
RMQ: Range Maximum/Minimum Query
<!DOCTYPE html> | |
<html> | |
<head> | |
<title>Title</title> | |
<meta http-equiv="Content-Type" content="text/html; charset=utf-8"> | |
</head> | |
<body> | |
</body> |
//sort, reverse | |
#include <algorithm> | |
#include <cstdio> | |
#include <vector> | |
using namespace std; | |
int cmp(int a,int b){ | |
return a>b;//小於:由小而大 ,大於:由大而小 |
#Codeforces簡單介紹
供首次參加者快速了解規則
//編輯中
###Rating
#Google Code Jam 賽制介紹
文章轉移至: https://domen-blog.github.io/posts/2016-04-10/google-code-jam-introduction/ 這裡不再更新
###解題 / 大小測資
每題有分大小測資,解題時下載輸入測資檔,並上傳輸出答案