QieQiemin

HDU/POJ...

ACM刷题之旅(9) ACM常用知识(7) Atcoder/洛谷(83) a牛客网/comet OJ(200) codeforces(323) STL(2) 二分(1) 二分/三分(2) 几何（计算几何，解析几何）(7) 分治/偏序(2) 动态规划DP(18) 图的全家桶/ 最短路/Tarjan强连通/MST/拓扑(7) 字符串处理/ hash(5) 字符串的高级算法/ACM(1) 思维(5) 搜索系列/BFS/DFS(2) 数学/MATH/ 组合数学/(5) 数据结构/线段树/树状数组(12) 数论(7) 暴力/状态压缩/二进制枚举(2) 未归档(4) 构造/技巧(7) 树的全家桶/ 树形DP/ LCA/MST/树链剖分(6) 模拟/实现(2) 模板(19) 组队赛训练记录(2) 规律/打表/结论题(2) 贪心(1) 题解(1) 高精/大数(6)

/ 注册

全部文章 / HDU/POJ/BZOJ/计蒜客（共108篇）

Can you answer these queries V SPOJ - GSS5 （分类讨论+线段树维护区间最大子段和）

recursion有一个整数序列a[n]。现在recursion有m次询问，每次她想知道Max { A[i]+A[i+1]+...+A[j] ; x1 <= i <= y1 , x2 <= j <= y2 , x1 <= x2 , y1 <= y2 }。这么简单的...

2019-09-02

0 336

Can you answer these queries V SPOJ - GSS5 （分类讨论+线段树维护区间最大子段和）

recursion有一个整数序列a[n]。现在recursion有m次询问，每次她想知道Max { A[i]+A[i+1]+...+A[j] ; x1 <= i <= y1 , x2 <= j <= y2 , x1 <= x2 , y1 <= y2 }。这么简单的...

2019-09-02

0 356

Can you answer these queries I SPOJ - GSS1 （线段树维护区间连续最大值/最大连续子段和）

You are given a sequence A[1], A[2], ..., A[N] . ( |A[i]| ≤ 15007 , 1 ≤ N ≤ 50000 ). A query is defined as follows: Query(x,y) = Max { a[i]+a[i+1]+......

2019-08-31

0 416

Can you answer these queries I SPOJ - GSS1 （线段树维护区间连续最大值/最大连续子段和）

You are given a sequence A[1], A[2], ..., A[N] . ( |A[i]| ≤ 15007 , 1 ≤ N ≤ 50000 ). A query is defined as follows: Query(x,y) = Max { a[i]+a[i+1]+......

2019-08-31

0 359

Tunnel Warfare HDU - 1540 （线段树处理连续区间问题）

During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, vil...

2019-08-22

0 409

Tunnel Warfare HDU - 1540 （线段树处理连续区间问题）

During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, vil...

2019-08-22

0 352

2019 年百度之星·程序设计大赛 - 初赛一 C. HDU 6670 Mindis 离散化+dijkstra

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6670 Mindis Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total ...

2019-08-21

0 409

2019 年百度之星·程序设计大赛 - 初赛一 C. HDU 6670 Mindis 离散化+dijkstra

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=6670 Mindis Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total ...

2019-08-21

0 286

Balancing Act POJ - 1655 （树的重心）

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more t...

2019-08-19

0 466

Balancing Act POJ - 1655 （树的重心）

Consider a tree T with N (1 <= N <= 20,000) nodes numbered 1...N. Deleting any node from the tree yields a forest: a collection of one or more t...

2019-08-19

0 288