线段树
文章平均质量分 84
liyunlong41
你必须非常努力,才能看起来毫不费力。
展开
-
hdu 1166 线段树与树状数组入门 单点更新
敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56135 Accepted Submission(s): 23603 Problem Description C国的死对头A国这段时间正在进行军事演习,所以原创 2015-07-20 21:27:07 · 380 阅读 · 0 评论 -
hdu 1754 线段树入门 单点更新
I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 48222 Accepted Submission(s): 18880 Problem Description 很多学校流行一种比较的习惯。老师们很原创 2015-07-21 11:13:42 · 443 阅读 · 0 评论 -
hdu 1698 线段树的区间修改 模板~~
把给定区间内的数全部更改为另一个数,线段树区间更新 模版,参考别人的代码 #include #include #include #include #include #include #include #include #include #include #include #define inf 0x3f3f3f3f #define mem(a,x) memset(a,x,sizeof(a原创 2015-07-25 17:48:07 · 438 阅读 · 0 评论 -
hihocoder 1078# 线段树的区间修改模版
#include #include #include #include #include #include #include #include #include #include #include #include #define inf 0x3f3f3f3f #define mem(a,x) memset(a,x,sizeof(a)) using namespace std; typedef原创 2015-08-19 22:41:56 · 364 阅读 · 0 评论 -
hdu 5023 线段树
A Corrupt Mayor's Performance Art Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others) Total Submission(s): 1655 Accepted Submission(s): 582 Problem Descript原创 2015-09-17 22:44:02 · 354 阅读 · 0 评论 -
zoj3911 线段树区间修改与求素数的结合
Prime Query Time Limit: 1 Second Memory Limit: 196608 KB You are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence. Her原创 2015-10-28 23:06:40 · 384 阅读 · 0 评论 -
codeforces 19D 线段树+set
D. Points time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Pete and Bob invented a new interesting game. Bob takes a s原创 2016-02-17 14:17:31 · 661 阅读 · 0 评论 -
codeforces B. Maximum Absurdity 线段树查找最大值的位置
B. Maximum Absurdity time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Reforms continue entering Berland. For原创 2016-05-25 15:15:36 · 597 阅读 · 0 评论