06 2014 档案

[NOI2011] 兔农 矩阵乘法，矩阵的等比数列求和
摘要：#include#include#include#includeusing namespace std;typedef long long ll;ll n,p;ll k;#define N 4000000ll a[N],fr[N];struct sq{ ll a[3][3]; sq(){... 阅读全文
posted @ 2014-06-30 22:34 wangyucheng 阅读(298) 评论(0) 推荐(0)
[NOI2010]超级钢琴 划分树+堆
摘要：#include#include#include#include#includeusing namespace std;#define N 510000struct P{ int x,y; P(int a=0,int b=0){x=a,y=b;} bool operator=k)retu... 阅读全文
posted @ 2014-06-26 22:26 wangyucheng 阅读(189) 评论(0) 推荐(0)
[noi2013]快餐店 基环树dp，单调队列维护最大值和次大值
摘要：#include#include#include#includeusing namespace std;#define N 220000#define inf 0x3ffffffffffffffLLtypedef long long ll;int v[N],e[N],ne[N],nn,w[N];vo... 阅读全文
posted @ 2014-06-25 07:49 wangyucheng 阅读(482) 评论(0) 推荐(0)
bzoj2878: [Noi2012]迷失游乐园 基环树dp求路径期望
摘要：#include#include#include#includeusing namespace std;#define N 110000int e[N],ne[N*2],v[N*2],w[N*2];typedef double dd;int nn;dd dp1[N];void add(int x,i... 阅读全文
posted @ 2014-06-21 19:29 wangyucheng 阅读(334) 评论(0) 推荐(0)
bzoj 1014:[JSOI2008]火星人prefix splay维护hash 二分求lcp
摘要：#include#include#include#includeusing namespace std;#define N 220000int ch[N][2],pre[N],s[N],val[N],b[N],root,tot,siz[N];char a[N];int ff[N];void up(i... 阅读全文
posted @ 2014-06-20 22:51 wangyucheng 阅读(163) 评论(0) 推荐(0)
[Noi2010]Plane 航空管制 贪心
摘要：#include#include#include#includeusing namespace std;#define N 2100#define M 11000int t[N];int n,m;int dp[N];int ru[N],op[N];int e[N],ne[M],v[M];int nn... 阅读全文
posted @ 2014-06-19 14:42 wangyucheng 阅读(184) 评论(0) 推荐(0)
poj 3415 后缀数组分组+排序+并查集
摘要：Source CodeProblem:3415User:wangyuchengMemory:16492KTime:704MSLanguage:C++Result:AcceptedSource Code#include#include#include#includeusing namespace st... 阅读全文
posted @ 2014-06-13 18:05 wangyucheng 阅读(277) 评论(0) 推荐(0)
tsinsen A1364. 社交网络结构洞
摘要：试题来源 清华大学2012年信息学优秀高中学子夏令营问题描述 近日，社交网络研究的鼻祖Jon Kleinberg教授在清华大学给同学们带来了一个关于社交网络结构洞（Structural Hole）的主题演讲。对社交网络有着浓厚兴趣的小W也旁听了这次演讲。在演讲中Jon Kleinberg教授讲到... 阅读全文
posted @ 2014-06-11 22:34 wangyucheng 阅读(2502) 评论(2) 推荐(0)
poj3335 半平面交模版
摘要：#include#include#include#includeusing namespace std;typedef double dd;#define N 200struct P{ dd x,y; P(dd a=0,dd b=0){ x=a,y=b; ... 阅读全文
posted @ 2014-06-07 21:44 wangyucheng 阅读(182) 评论(0) 推荐(0)
poj3648 wedding 2-SAT
摘要：#include#include#include#includeusing namespace std;int n,m;#include#define N 8200int e[N],v[N],ne[N];int nn;void add(int x,int y){ ne[++nn]=e[x],e[... 阅读全文
posted @ 2014-06-05 12:32 wangyucheng 阅读(184) 评论(0) 推荐(0)