G.D.Retop的专栏

An easy problemTime Limit: 8000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 746    Accepted Submission(s): 427Problem DescriptionOne day, a u

求区间第k大树。通常用划分树模板就可以做了。而且空间也挺小的。主席树也是可以的。主席树是什么呢？看一下别人的博客http://seter.is-programmer.com/posts/31907.html主席树是这样的。1. 平时在建立线段树的时候是建一棵完整的线段树。然后在这个线段树中进行操作。2.但是在修改线段树的时候---单点修改。 可知，需要修改的

splay。只为了贴代码保存，没用其他作用。#include#include#include#includeusing namespace std;#define maxn 500007#define inf 1000000000struct Node{ Node *fa,*ch[2]; int val,gcd[2],size,statu;};Nod

The LCIS on the TreeTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 533    Accepted Submission(s): 167Problem DescriptionFor a s

#pragma comment(linker, "/STACK:102400000,102400000")#include#include#include#includeusing namespace std;#define maxn 500007#define inf 1000000000struct Node{ Node *fa,*ch[2]; bool re

Query on The TreesTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2628    Accepted Submission(s): 1223Problem DescriptionWe hav

#include#include#include#includeusing namespace std;#define maxn 300007#define inf 1000000000struct Node{ Node *fa,*ch[2]; bool rev,root; int val,add,set,size; int max[2],num[2

t#include#include#include#include#includeusing namespace std;struct Node{ int map[4][8];};int map1[4][8];Node queue[100001];sethaha;int dist[100001];int en;int

Game on S♂playTime Limit: 16000/8000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 294    Accepted Submission(s): 52Problem DescriptionUncle Fang is l

#include#include#include#includeusing namespace std;#define maxn 5000001int ch[maxn][2],fa[maxn],val[maxn],lz[maxn],root,cnt,size[maxn];void init(){ cnt=1; root=ch[0][0]=ch[0][1]=0;

Double QueueTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10244 Accepted: 4651DescriptionThe new founded Balkan Investment Group Bank (BIG-Bank) opene

#include#include#include#define maxn 100007using namespace std;int ord[maxn],onleft[18][maxn],val[18][maxn];void build(int fl,int l,int r){ if(l == r) return; int mid = (l+r)/2,fn=fl+1;

#pragma comment(linker,"/STACK:100000000,100000000")#include#include#include#include#includeusing namespace std;#define maxn 70007#define lc u<<1#define rc u<<1|1#define ll long longstruct

《高级数据结构及算法》 目     录 第一部分. 用于索引的数据结构 A. AVL 树 B. B+树 C. 2-3-4树 D. 红黑树 第二部分. 用于优先队列的数据结构 A. 堆  B. 左偏树与动态树 C. 斐波那契堆 D. Treap树堆 第三部分 用于在线动态区间处理的数据结构 A. 树状数组（Binary Index Tree） B. 线段树（S

AssignmentTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 86    Accepted Submission(s): 43Problem DescriptionTom owns a company

Level upTime Limit: 10000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3674    Accepted Submission(s): 994Problem DescriptionLevel up is the t

BoxTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2421    Accepted Submission(s): 737Problem DescriptionThere are N boxes on t

TreeTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 6171 Accepted: 1687DescriptionYou are given a tree with N nodes. The tree’s nodes are numbered 1

其他题做法：Non-boring sequences求是否任意子串中，都有一个数，这个数只出现一次：方法：跟矩形面积并一样，从右到左做，用线段树维护，对于i位置，如果线段树中恰好有n-i+1个点被覆盖了，说明有解，否则无解。如何构造线段？： 对于a(1)......a(i).......(N)括号里的数字表示位置，a表示一个数有两个a，对于a(2)如果已经走过i位置，且目前

QTREE - Query on a treeno tags You are given a tree (an acyclic undirected connected graph) with N nodes, and edges numbered 1, 2, 3...N-1.We will ask you to perfrom some instructions

Problem 2082 过路费Accept: 393    Submit: 1301Time Limit: 1000 mSec    Memory Limit : 32768 KB Problem Description有n座城市，由n-1条路相连通，使得任意两座城市之间可达。每条路有过路费，要交过路费才能通过。每条路的过路费经常会更新，现问你，当前情况下，从城市a到

Housewife WindTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7479 Accepted: 1938DescriptionAfter their royal wedding, Jiajia and Wind hid away in XX

GCD TreeTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 122    Accepted Submission(s): 56Problem DescriptionTeacher Mai has a gr

Sometimes NaiveTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 11    Accepted Submission(s): 6Problem DescriptionRhason Cheung h

Segment GameTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 244    Accepted Submission(s): 42Problem DescriptionLillian is a cle

TransformationTime Limit: 15000/8000 MS (Java/Others)    Memory Limit: 65535/65536 K (Java/Others)Total Submission(s): 3579    Accepted Submission(s): 859Problem DescriptionYuanfang is

2055. Urban GeographyTime limit: 2.0 secondMemory limit: 128 MBAndroid Vasya prepares a project in Urban geography. The aim of the project is to improve the infrasructure of the city he

ZZX and PermutationsTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 141    Accepted Submission(s): 24Problem DescriptionZZX li

Boring ClassTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 354    Accepted Submission(s): 75Problem DescriptionMr. Zstu and Mr.

Queue-jumpersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1663    Accepted Submission(s): 393Problem DescriptionPonyo and Gar