数据结构
关注
分享
扫一扫
文章平均质量分 73
cyendra
Azarath Metrion Zinthos
展开
-
SGU 271 Book Pile 双端队列
------------int n,m,k;dequeque;vectorans;char cmd[22],c[4];;int bit;int main(){ scanf("%d%d%d",&n,&m,&k); que.clear(); ans.clear(); for (int i=0;i<n;i++){ scanf("%s",c);原创 2014-01-05 13:23:12 · 803 阅读 · 0 评论 -
POJ 2970 The lazy programmer 优先队列
--------------const double EPS = 1e-7;const int maxn=150000;int dcmp(double a,double b){ if (abs(a-b)<EPS) return 0; if (a>b) return 1; else return -1;}struct Dat{ int a,b,d;原创 2014-01-06 00:53:01 · 868 阅读 · 0 评论 -
ZOJ 2112 Dynamic Rankings 线段树套平衡树
------------const int N=60010;const int M=10010;class SegmentTree_Treap{private: struct Treap{ int key,fix,cnt,size,ch[2]; }T[N*15]; int tree[N<<1],nodecnt; int ID(int l,原创 2014-01-07 00:09:43 · 623 阅读 · 0 评论 -
ZOJ 2334 Monkey King 可并堆左偏树
----------int n,m;class LeftistTree{private: int tot,v[maxn],l[maxn],r[maxn],d[maxn];public: int merge(int x,int y){ if (!x) return y; if (!y) return x; if (v[x]<原创 2014-01-07 22:10:14 · 624 阅读 · 0 评论 -
POJ 2786 Keep the Customer Satisfied 优先队列
----------const int maxn=900000;const int maxm=10000;int n;struct Dat{ int v,lim; const bool operator<(const Dat& rhs) const{ return v<rhs.v; }}a[maxn];bool cmp(Dat a,Dat b原创 2014-01-08 23:01:27 · 749 阅读 · 0 评论