线段树
破晓aa
这个作者很懒,什么都没留下…
展开
-
Tunnel Warfare(线段树)
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except t...原创 2018-06-11 21:04:54 · 177 阅读 · 0 评论 -
I - Colonial Mansions Gym - 101962I(线段树 + 二分)
After a year of hard work, Mano finally had a month off. He decided to take his grandmother to Soteropolis during this time. As soon as they arrived at the airport, Mano bought one of these "10 things...原创 2018-11-02 08:35:22 · 333 阅读 · 0 评论 -
P - Atlantis HDU - 1542(矩形面积并 + 线段树离散化优化)
There are several ancient Greek texts that contain descriptions of the fabled island Atlantis. Some of these texts even include maps of parts of the island. But unfortunately, these maps describe diff...原创 2018-10-06 17:01:32 · 242 阅读 · 5 评论 -
L - Vases and Flowers HDU - 4614(线段树)
Problem Description Alice is so popular that she can receive many flowers everyday. She has N vases numbered from 0 to N-1. When she receive some flowers, she will try to put them in the vases, one...原创 2018-09-27 20:41:53 · 284 阅读 · 0 评论 -
K - Transformation HDU - 4578(线段树)
Yuanfang is puzzled with the question below: There are n integers, a 1, a 2, …, a n. The initial values of them are 0. There are four kinds of operations. Operation 1: Add c to each number between a x...原创 2018-09-27 20:32:28 · 442 阅读 · 5 评论 -
约会安排 HDU - 4553
寒假来了,又到了小明和女神们约会的季节。 小明虽为屌丝级码农,但非常活跃,女神们常常在小明网上的大段发言后热情回复“呵呵”,所以,小明的最爱就是和女神们约会。与此同时,也有很多基友找他开黑,由于数量实在过于巨大,怎么安排时间便成了小明的一大心事。 我们已知小明一共有T的空闲时间,期间会有很多女神或者基友来找小明。 作为一个操作系统曾经怒考71分的大神,小明想到了一个算法,即“首次适应...原创 2018-09-27 20:26:14 · 341 阅读 · 0 评论 -
N - Picture POJ - 1177(矩形周长并 + 线段树 + 离散化)
A number of rectangular posters, photographs and other pictures of the same shape are pasted on a wall. Their sides are all vertical or horizontal. Each rectangle can be partially or totally covered b...原创 2018-10-05 16:33:18 · 355 阅读 · 0 评论 -
J - Assign the task HDU - 3974(线段树 + dfs序)
There is a company that has N employees(numbered from 1 to N),every employee in the company has a immediate boss (except for the leader of whole company).If you are the immediate boss of someone,that ...原创 2018-09-24 14:54:32 · 318 阅读 · 0 评论 -
K - Transformation HDU - 4578(线段树)
Yuanfang is puzzled with the question below: There are n integers, a 1, a 2, …, a n. The initial values of them are 0. There are four kinds of operations. Operation 1: Add c to each number between a x...原创 2018-09-24 14:39:39 · 279 阅读 · 0 评论 -
D - Mayor's posters POJ - 2528 线段树 + 离散化(写一篇博客纪念一下)
https://cn.vjudge.net/problem/POJ-2528 一个十分经典的题,想用自己的法子离散化,硬是wa了40多发还没能过,整个人都要自闭了,贼难受。最后无奈用了别人的方法,好不爽。。。 我在此主要讲一下离散化的方法(当然是别人的方法啦),此题完整的代码放在最后!!!! 1.先把每条线段的单独存下来,同时把每个端点的值存在另一个数组里,在此把图放上 ...原创 2018-08-10 19:58:47 · 517 阅读 · 2 评论 -
线段树(区间更新)
#include <iostream> #include <cstdio> using namespace std; typedef long long ll; ll a[100005]; struct node { int l, r; ll sum, lazy; }tree[500005]; int n; void Updown(int rt) ...原创 2018-06-06 17:18:39 · 656 阅读 · 0 评论 -
The Battle of Chibi HDU - 5542 (dp + 树状数组 + 离散化)
Cao Cao made up a big army and was going to invade the whole South China. Yu Zhou was worried about it. He thought the only way to beat Cao Cao is to have a spy in Cao Cao's army. But all generals and...原创 2018-12-25 11:19:33 · 220 阅读 · 0 评论