- 博客(14)
- 收藏
- 关注
RSS订阅原创 BZOJ 3673/3674(可持久化并查集 by zky,可持久化并查集加强版-可持久化数组)
可持久化数组可以模拟可持久化并查集（新技能get） 参考了hzwer的代码.#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i++
2016-06-30 23:57:50
467
原创 Codeforces Round #360 (Div. 1) 题解(待续)
NP-Hard ProblemRemainders GameThe Values You Can MakeNP-Hard Problem给一幅图，把点集分为两份，使每一份都是原图的顶点覆盖 判定1副图是不是二分图，这并不是np-hard#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i
2016-06-30 14:49:34
422
原创 几何基础专题
UVA 11437 Triangle FunUVA 11800 Determine the Shape 四边形判定UVA 11646 Athletics TrackUVA 11817 Tunnelling the Earth 球面距离UVA 1473 Dome of CircusUVA 11524 InCircleUVA 11731 Ex-circles 旁切圆UVA 12300 Sm
2016-06-29 02:42:32
2164
原创 几何专题
UVA 11178 Morley 定理LA 3263 That Nice Euler Circuit Shanghai 2004 欧拉定理UVA 11796 Dog DistanceUVA 12304 2D Geometry 110 in 1 内接圆和外接圆UVA 11178 Morley 定理#include<bits/stdc++.h>using namespace std;#def
2016-06-26 13:44:40
472
原创 IPSC 2016 题解(待续)
Problem A Avoiding accidentsProblem C Counting swapsC small C big 得挂机Problem D Dumb clickingsmall caseProblem G Greatest numberProblem A – Avoiding accidents有几行注释掉是应付small的 不过我写的也太不优拉，大数据n那么小
2016-06-20 15:46:38
693
原创 IPSC 2016 Practice Session 题解（待续）
Problem S SubsequenceProblem S – SubsequenceYou are given two strings A and B. Find whether B is a subsequence of A.The subsequence does not need to be contiguous. In other words, your task is to find
2016-06-20 15:35:54
675
原创 Codeforces Round #358 (Div. 2)
Alyona and NumbersAlyona and MexAlyona and the TreeAlyona and StringsAlyona and TrianglesAlyona and Numbers#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#defin
2016-06-18 13:06:45
350
原创 Surprise Language Round #8 题解(待补)
The Check of the PointThe Check of the Pointfun main(args: Array<String>) { val (a, x, y) = readLine()!!.split(' ').map(String::toInt) if (0<x && x<a && 0<y && y<a) println("0") else if (0>
2016-06-18 12:55:35
317
原创 数论专题
Always an integerAlways an integerc++,string类的花式使用#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int
2016-06-12 21:37:41
518
原创 Yandex.Algorithm 2016 Online Round 2 题解(待补)
Role DistributionBinary Representation GameMilk ProductsRole Distribution#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)
2016-06-11 14:28:37
512
原创 Codeforces Round #356 (Div. 1) 题解(待补)
Bear and Prime 100Bear and Tower of CubesBear and Square GridBear and Prime 100This is an interactive problem. In the output section below you will see the information about flushing the output.Bear
2016-06-09 23:12:34
718
原创 2016 计蒜之道 初赛 第二场(待补)
A 联想公司的 logo 设计B联想的显示屏校准A. 联想公司的 logo 设计#include<bits/stdc++.h>using namespace std;#define For(i,n) for(int i=1;i<=n;i++)#define Fork(i,k,n) for(int i=k;i<=n;i++)#define Rep(i,n) for(int i=0;i<n;i
2016-06-07 02:01:53
3451
原创 2016 计蒜之道 初赛 第一场 题解(待补)
A 青云的服务器密钥B 青云的机房组网方案简单A. 青云的服务器密钥对于密钥 S1..Sn，我们需要首先计算其对应的π 数组。对于任意的 i(2≤i≤n)，πi=max{L|S1...SL=Si−L+1...Si,(0≤L<i)}i(2≤i≤n)，\pi_i=max\{L|S_1...S_L=S_{i-L+1}...S_i, (0 \leq L < i)\} 也就是最长的前缀等于后缀的长度。
2016-06-07 00:34:57
770
原创 Codeforces Round #355 (Div. 2) 题解(待补)
Vanya and FenceVanya and Food ProcessorVanya and LabelVanya and Fenceint n=read(),h=read(),ans=0; For(i,n){ ans+=1+(read()>h); } cout<<ans<<endl;Vanya and Food Processor ll n,h
2016-06-03 02:20:49
578
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人