nimphy - 博客园

2017年12月20日

摘要： After their royal wedding, Jiajia and Wind hid away in XX Village, to enjoy their ordinary happy life. People in XX Village lived in beautiful huts. T 阅读全文

posted @ 2017-12-20 17:30 nimphy 阅读(323) 评论(0) 推荐(0) 编辑

POJ3107Godfather（求树的重心裸题）

摘要： Last years Chicago was full of gangster fights and strange murders. The chief of the police got really tired of all these crimes, and decided to arres 阅读全文

posted @ 2017-12-20 09:06 nimphy 阅读(388) 评论(0) 推荐(0) 编辑

2017年12月19日

POJ1741 Tree（树的点分治基础题）

摘要： Give a tree with n vertices,each edge has a length(positive integer less than 1001).Define dist(u,v)=The min distance between node u and v. Give an in 阅读全文

posted @ 2017-12-19 21:47 nimphy 阅读(283) 评论(0) 推荐(0) 编辑

2017年12月18日

SPOJ Query on a tree II （树剖||倍增LCA）（占位）

摘要： 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 t 阅读全文

posted @ 2017-12-18 22:26 nimphy 阅读(178) 评论(0) 推荐(0) 编辑

SPOJ Query on a tree III (树剖(dfs序)+主席树 || Splay等平衡树)（询问点）

摘要： You are given a node-labeled rooted tree with n nodes. Define the query (x, k): Find the node whose label is k-th largest in the subtree of the node x 阅读全文

posted @ 2017-12-18 22:26 nimphy 阅读(241) 评论(0) 推荐(0) 编辑

SPOJ375Query on a tree I（树剖+线段树）（询问边）

摘要： ι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 some instruct 阅读全文

posted @ 2017-12-18 21:57 nimphy 阅读(195) 评论(0) 推荐(0) 编辑

2017年12月17日

HDU5768Lucky7（中国剩余定理+容斥定理）(区间个数统计)

摘要： When ?? was born, seven crows flew in and stopped beside him. In its childhood, ?? had been unfortunately fall into the sea. While it was dying, seven 阅读全文

posted @ 2017-12-17 21:14 nimphy 阅读(270) 评论(0) 推荐(0) 编辑

POJ2891Strange Way to Express Integers (线性同余方程组)

摘要： Elina is reading a book written by Rujia Liu, which introduces a strange way to express non-negative integers. The way is described as following: Choo 阅读全文

posted @ 2017-12-17 19:12 nimphy 阅读(229) 评论(0) 推荐(0) 编辑

HihoCoder1665方块游戏([Offer收割]编程练习赛40)(线段树)

摘要：时间限制:10000ms 单点时限:1000ms 内存限制:256MB 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述小Ho在玩一款类似俄罗斯方块的游戏。与原版俄罗斯方块不同的是，落下方块都是长度不一的横向长条，并且不能移动也不能变成竖直方向。 XXXXXX <- 长阅读全文

posted @ 2017-12-17 16:40 nimphy 阅读(304) 评论(0) 推荐(0) 编辑

HihoCoder1664 01间隔方阵（[Offer收割]编程练习赛40）（DP）

摘要：给定一个NxM的01矩阵，小Hi希望从中找到一个01间隔的子方阵，并且方阵的边长越大越好。例如对于 0100100 1000101 0101010 1010101 0101010 在右下角有一个4x4的01间隔方阵。 Input 第一行包含两个整数N和M。以下N行M列包含一个NxM的01矩阵。阅读全文

posted @ 2017-12-17 16:38 nimphy 阅读(282) 评论(2) 推荐(0) 编辑

---学习ing---

学习ing、创业ing