lzr010506

分类

bzoj(18) DP优化(1) hdu(1) manacher （马拉车）(1) poj(7) 博客(4) 博弈论(1) 未归档(54) 杂题(1) 树状数组(1) 水题(2) 矩阵快速幂(1) 网络流(2) 计算几何(2)

/ 注册

全部文章（共93篇）

bzoj3524 [Poi2014]Couriers

Description 给一个长度为n的序列a。1≤a[i]≤n。 m组询问，每次询问一个区间[l,r]，是否存在一个数在[l,r]中出现的次数大于(r-l+1)/2。如果存在，输出这个数，否则输出0。 Input 第一行两个数n，m。第二行n个数，a[i]。接下来m行，每行两个数l...

2016-05-18

0 431

bzoj1573 [Usaco2009 Open]牛绣花cowemb

Description Bessie学会了刺绣这种精细的工作。牛们在一片半径为d(1 <= d <= 50000)的圆形布上绣花. 它们一共绣了N (2 <= N <= 50000)条直线，每条直线连接布的边缘上的两个点(没有两条线通过边上同一个点)。作为一只热爱数学的牛...

2016-05-18

0 617

bzoj 1571~1755 简单题解（持续更新）

如果有值得粘的代码我会留链接。 bzoj 1571 水动态规划定义f[i][j]代表在i时间，能力值为j的最多滑雪次数。对应最后三种选择： ①美美地喝上一杯可可汁 f[i][j]=f[i-1][j], ②上课 f[i][j]=f[上课前一个时刻][任意], ③滑雪 ...

2016-05-17

0 445

bzoj1571 滑雪课Ski

粘代码 #include <bits/stdc++.h> #define N 20000 using namespace std; struct T { int x, y, z; }a[N]; int dp[N][200], w[N], t,s,n; inline int...

2016-05-17

0 410

SPOJ PT07J Query on a tree II

You are given a tree (an undirected acyclic connected graph) with N nodes, and edges numbered 1, 2, 3…N-1. Each edge has an integer value assigned to ...

2016-05-17

0 450

倍增LCA poj1330 Nearest Common Ancestors

Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node ...

2016-05-17

0 421

SPOJ375 Query on a tree

Description 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 so...

2016-05-16

0 370

poj3974 Palindrome

Description Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, “Can y...

2016-04-29

0 408

poj1207 The 3n + 1 problem

Description Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this ...

2016-04-29

0 397

poj2524 Ubiquitous Religions

Language: Ubiquitous Religions Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 30365 Accepted: 14715 Description There are so many dif...

2016-04-22

0 334