ACM - 主席树
LP_Cong
Python, Qt C++ Developer ACMer https://github.com/Linzecong
展开
-
HDU - 4417 Super Mario (静态区间查询<=x的个数)
Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to原创 2017-10-26 17:52:23 · 360 阅读 · 0 评论 -
CodeForces - 1046A AI robots(动态开点线段树)
A. AI robotstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn the last mission, MDCS has successfully shipped NN AI robots to M...原创 2018-11-10 16:58:25 · 383 阅读 · 0 评论 -
CodeForces - 1000F One Occurrence(莫队+分块 | 线段树 | 主席树)
F. One Occurrencetime limit per test3 secondsmemory limit per test768 megabytesinputstandard inputoutputstandard outputYou are given an array aa consisting of nn integers, and qq que...原创 2018-10-23 17:44:27 · 476 阅读 · 0 评论 -
ZOJ - 4053 Couleur(ACM-ICPC 2018 青岛赛区网络预赛 G)(主席树+线段树+启发式暴力)
CouleurTime Limit: 6 Seconds Memory Limit: 131072 KBDreamGrid has an array of integers. On this array he can perform the following operation: choose an element that was not previously chosen...原创 2018-09-17 22:36:00 · 568 阅读 · 0 评论 -
HDU - 6278 Just h-index(2018CCPC湘潭邀请赛C)
Just h-index Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem DescriptionThe h-index of...原创 2018-05-19 18:11:52 · 475 阅读 · 0 评论 -
HDU - 5709 Claris Loves Painting (线段树合并+动态开点)
Claris Loves PaintingTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 524 Accepted Submission(s): 148 Problem DescriptionClaris lov...原创 2018-09-02 19:05:58 · 448 阅读 · 0 评论 -
HDU - 6287 口算训练 (主席树)(2018CCPC女生赛)
口算训练Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 359 Accepted Submission(s): 70Problem Description小Q非常喜欢数学,但是他的口算能力非常弱。因此他找到了小T,给了小T一个长度...原创 2018-05-30 14:42:54 · 720 阅读 · 0 评论 -
BZOJ - 3514 Codechef MARCH14 GERALD07加强版 (2018ACM广东省赛G)(LCT+主席树)
3514: Codechef MARCH14 GERALD07加强版Time Limit: 60 Sec Memory Limit: 256 MBSubmit: 2269 Solved: 871[Submit][Status][Discuss]DescriptionN个点M条边的无向图,询问保留图中编号在[l,r]的边的时候图中的联通块个数。Input第一行四个整数N、M、K、type,代表点...原创 2018-05-09 18:00:29 · 269 阅读 · 0 评论 -
CodeForces - 960F Pathwalks (LIS线段树解法 + 主席树)
F. Pathwalkstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a directed graph with n nodes and m edges, with all edges having a certai...原创 2018-04-20 19:07:30 · 330 阅读 · 0 评论 -
HYSBZ - 4999 This Problem Is Too Simple! (主席树)
4999: This Problem Is Too Simple!Time Limit: 10 Sec Memory Limit: 256 MBSubmit: 459 Solved: 204[Submit][Status][Discuss]Description给您一颗树,每个节点有个初始值。现在支持以下两种操作:1. C i x(0<=x<2^31) 表示将i节点的值改为x。2....原创 2018-04-11 16:21:39 · 238 阅读 · 0 评论 -
HDU - 2665 Kth number (静态区间第k大)
Give you a sequence and ask you the kth big number of a inteval.InputThe first line is the number of the test cases. For each test case, the first line contain two integer n and m (n, m The se原创 2017-10-25 13:17:54 · 296 阅读 · 0 评论 -
HDU - 4348 To the moon (可持久化线段树,区间查询加累加)
Background To The Moon is a independent game released in November 2011, it is a role-playing adventure game powered by RPG Maker. The premise of To The Moon is based around a technology that allow原创 2017-10-25 21:12:04 · 539 阅读 · 0 评论 -
Gym - 101630A Archery Tournament (动态开点线段树)
解题思路:一个X点上的圆的个数不会超过 logN个。所以完全可以线段树暴力。线段树动态开点即可。区间添加圆。然后暴力查询区间里面的圆是否满足答案。#include<iostream>#include<deque>#include<memory.h>#include<stdio.h>#include<map>...原创 2018-11-11 13:59:11 · 500 阅读 · 0 评论