数据结构 - 随笔分类 - TO_Asia

几乎就是并查集 (Almost Union-Find,UVa 11987)

摘要：#include #include #include #include #include #include #include #include #include #include using namespace std;const double eps = 1e-8;const double pi=acos(-1.0);const int INF=0x7fffffff;unsigned long long uINF = ~0LL;#define MAXN 100007#define mod 1000000007typedef long long LL;int pb[MAXN],pa[MAXN] 阅读全文

posted @ 2013-07-31 16:40 TO_Asia 阅读(369) 评论(0) 推荐(0)

LA 5902,Movie collection

摘要：1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 const double eps = 1e-8;13 const double pi=acos(-1.0);14 const int INF=0x7fffffff;15 unsigned long long uINF = ~0LL;16 #define MAXN 20000717 #define mod 1... 阅读全文

posted @ 2013-07-31 15:51 TO_Asia 阅读(311) 评论(0) 推荐(0)

电位计 (Potentiometers,Dhaka 2006,LA 2191)

摘要：1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 const double eps = 1e-8;13 const double pi=acos(-1.0);14 const int INF=0x7fffffff;15 unsigned long long uINF = ~0LL;16 #define MAXN 20000717 #define mod 1... 阅读全文

posted @ 2013-07-31 10:17 TO_Asia 阅读(309) 评论(0) 推荐(0)

促销活动 (Hoax or what,UVa 11136)

摘要：1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 const double eps = 1e-8;13 const double pi=acos(-1.0);14 const int INF=0x7fffffff;15 unsigned long long uINF = ~0LL;16 #define MAXN 100717 #define mod 100... 阅读全文

posted @ 2013-07-30 11:21 TO_Asia 阅读(339) 评论(0) 推荐(0)

破损的键盘 (Broken Keyboard,UVa 11988)

摘要：1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 #include 10 #include 11 using namespace std;12 const double eps = 1e-8;13 const double pi=acos(-1.0);14 const int INF=0x7fffffff;15 unsigned long long uINF = ~0LL;16 #define MAXN 100717 #define mod 100... 阅读全文

posted @ 2013-07-30 09:03 TO_Asia 阅读(533) 评论(0) 推荐(0)

hdu 1285 拓扑排序……

摘要：819467asia2562219EAccepted1260 KB62 msC++902 B2012-11-17 19:18:09拓扑排序水题，View Code #include<cstdio>#include<cstring>#include<string>#include<cstdlib>#include<algorithm>#include<iostream>using namespace std;#define MAXN 1111111int map[501][501],deg[501];int n,m;void 阅读全文

posted @ 2012-11-17 19:25 TO_Asia 阅读(156) 评论(0) 推荐(0)

hdu1251 字典树

摘要：又是字典树。水题做的有点多了啊 ……View Code #include<cstdio>#include<cstring>#include<string>#include<cstdlib>#include<algorithm>#include<iostream>#include<map>using namespace std;#define MAXN 1111111struct node{ int num; node *next[26];};node *root,tree[MAXN];int tot=0;no 阅读全文

posted @ 2012-11-17 17:00 TO_Asia 阅读(168) 评论(0) 推荐(0)

hdu 1247 map

摘要：818786asia2562219CAccepted4464 KB218 msC++615 B2012-11-17 16:05:08写个了字典树但又发现map 这个以前没用过的容器很好用map 建立 key-value 的关系表在log[N]内查找出value 这里用单词做key，value为1 及其简洁的查找子串是否存在（就是个懒）。。。View Code #include<cstdio>#include<cstring>#include<string>#include<cstdlib>#include<algorithm> 阅读全文

posted @ 2012-11-17 16:16 TO_Asia 阅读(149) 评论(0) 推荐(0)

hdu1103 模拟题……

摘要：71763832012-11-17 11:06:13Accepted110315MS292K1454 BC++TO_Asia71762832012-11-17 10:57:31Wrong Answer110315MS288K1176 BC++TO_Asia71762002012-11-17 10:47:35Wrong Answer11030MS288K1175 BC++TO_Asia一开始悲催的想用STL 事实证明强大的算法秒杀一切STL。View Code #include<iostream>#include<string>#include<string.h& 阅读全文

posted @ 2012-11-17 11:10 TO_Asia 阅读(388) 评论(0) 推荐(0)

hdu 1829 并查集*4

摘要：810639asia2562219AAccepted232 KB343 msC++1243 B2012-11-11 20:36:43这里两个点事分属两个集合，sex[i]保存与i性别不同的节点。View Code #include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;#define MAXN 1111111int father[MAXN],n,m,sex[MAXN]; 阅读全文

posted @ 2012-11-11 20:44 TO_Asia 阅读(139) 评论(0) 推荐(0)

poj1308 hdu1325！并查集*3

摘要：11007421asia25622191308Accepted1028K0MSC++1441B2012-11-11 20:08:11hdu WA；………… 受不了这题，hdu 案例都过不了的代码能AC——！View Code #include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;#define MAXN 111111int deg[MAXN],tot,father[M 阅读全文

posted @ 2012-11-11 20:10 TO_Asia 阅读(133) 评论(0) 推荐(0)

hdu 1558 并查集*2!!

摘要：810594asia2562219DAccepted276 KB140 msC++2041 B2012-11-11 19:42:09还是并查集，另学习了下判断两条线段是否相交。View Code #include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;#define MAXN 111111int father[1111];int n,tot;struct point{ 阅读全文

posted @ 2012-11-11 19:49 TO_Asia 阅读(158) 评论(0) 推荐(0)

hdu1598 依旧并查集

摘要：809773asia2562219EAccepted220 KB187 msC++1786 B2012-11-11 12:34:27 1 #include <cstdio> 2 #include <cstring> 3 #include <cstdlib> 4 #include <algorithm> 5 #include <iostream> 6 using namespace std; 7 #define MAXN 111111 8 int rank[222],father[222]; 9 int n,m,q;10 int max 阅读全文

posted @ 2012-11-11 12:40 TO_Asia 阅读(138) 评论(0) 推荐(0)

hdu 1272

摘要：808075asia2562219BAccepted1172 KB31 msC++1299 B2012-11-10 20:19:31水爆了 Yes 一直写成 YES————！并查集～#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;#define MAXN 111111int deg[MAXN],tot,father[MAXN],totnum,tote;bool 阅读全文

posted @ 2012-11-10 20:25 TO_Asia 阅读(184) 评论(0) 推荐(0)

poj 2513 Colored Sticks 字典树并查集

摘要：染色的树枝能否相同颜色边连接成一个欧拉回路#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;#define MAXN 5000050struct node{ int num; node *next[26];};node *root,tree[MAXN];int tot,totn=0;int deg[MAXN]; //度数int father[MAXN];voi 阅读全文

posted @ 2012-11-04 16:24 TO_Asia 阅读(131) 评论(0) 推荐(0)

hdu 3791 二叉查找树，BST

摘要：796093asia2562219FAccepted524 KB15 msG++1525 B2012-11-04 12:37:34关键字树~ 简单题。。前序中序判同。#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <iostream>using namespace std;#define MAXN 11111struct Node{char data;Node* left;Node* right;};class BT 阅读全文

posted @ 2012-11-04 12:45 TO_Asia 阅读(166) 评论(0) 推荐(0)

poj1741 树的分治

摘要：被这道题深深的伤害到了……http://poj.org/problem?id=174110985223asia25622191741Accepted1124K219MSC++2842B2012-11-03 23:59:11刚开始使用LCA解决问题，华丽丽超时，无脑百度了下。采用分治解决问题：题目的情况分两种：（1）两点间的路径经过根节点。（2）两点属于根节点的同一颗子树下。递归问题，所以只考虑第一种情况即可。dist[i]+dist[j]<=k 且 i和j 不在根节点的同一颗子树下；对dist排序可以在线性时间内求出符合的对数。最最坑了我的是分治时要找每颗树的重心。否则便是无尽阅读全文

posted @ 2012-11-04 00:14 TO_Asia 阅读(979) 评论(0) 推荐(0)

hdu1671 字典树

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=167170676642012-11-02 20:02:57Accepted1671390MS3352K945 BC++TO_Asia字典树~~ 找手感中~~isnext=1 记录是否有下一个节点，判断前缀后出现的情况。isnext=2 表示是一个字串的最后一个字符，判断前缀先出现的情况。#include<iostream>#include<stdio.h>#include<string>using namespace std;class node{public: int i 阅读全文

posted @ 2012-11-02 20:08 TO_Asia 阅读(132) 评论(0) 推荐(0)

hdu 2586 How far away ？ LCA，least common ancestors，树&&并查集

摘要：http://acm.hdu.edu.cn/showproblem.php?pid=258670461182012-10-30 23:47:29Accepted258631MS3988K1931 BC++TO_Asia树和并查集~~求树中两个点的最近距离转化成求两个点的最近公共祖先（LCA）mindist（u,v)=dist(u)+dist(v)-2*dist(lca(u,v));向量存储树的邻接点View Code 1 #include <iostream> 2 #include <stdio.h> 3 #include <vector> 4 usin 阅读全文

posted @ 2012-10-30 23:53 TO_Asia 阅读(116) 评论(0) 推荐(0)

TO_Asia

随笔分类 - 数据结构

公告