Live2d Test Env

随笔分类 -  RMQ---树状数组

上一页 1 2
HihoCoder1336 Matrix Sum(二维树状数组求和)
摘要：时间限制:10000ms 单点时限:1000ms 内存限制:256MB 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 You are given an N × N matrix. At the beginning every element is 0. Write a 阅读全文
posted @ 2017-12-04 08:02 nimphy 阅读(259) 评论(0) 推荐(0)
HDU3727 Jewel（主席树+树状数组（或二分））
摘要：Problem Description Jimmy wants to make a special necklace for his girlfriend. He bought many beads with various sizes, and no two beads are with the 阅读全文
posted @ 2017-12-02 14:52 nimphy 阅读(381) 评论(0) 推荐(0)
POJ2985 The k-th Largest Group (并查集+treap)
摘要：Newman likes playing with cats. He possesses lots of cats in his home. Because the number of cats is really huge, Newman wants to group some of the ca 阅读全文
posted @ 2017-11-27 21:04 nimphy 阅读(206) 评论(0) 推荐(0)
HihoCoder 1068 RMQ-ST算法+BIT
摘要：以前都是用的BIT或者线段树（前者多一些）。 对于ST（Sparse Table），在求倍增or公共祖先（LCA）时见过，说明还有其他用处，所以还是学习一下。 首先是预处理，用动态规划（DP）解决。 设A[i]是要求区间最值的数列，F[i, j]表示从第i个数起连续2^j个数中的最大值。（DP的状态 阅读全文
posted @ 2017-11-05 10:59 nimphy 阅读(280) 评论(0) 推荐(0)
hihoCoder
摘要：1599 逆向bfs+优化 #include<cstdio> #include<cstdlib> #include<iostream> #include<cstring> #include<algorithm> #include<string> using namespace std; int a, 阅读全文
posted @ 2017-10-20 15:56 nimphy 阅读(730) 评论(0) 推荐(0)
HDU1556 线扫
摘要：昨天睡得太晚，今天又在看新算法，明天事情也多，烦，所以今天刷刷水题就过去了。 叫我用线段树，我反而搞不来 阅读全文
posted @ 2017-10-17 19:28 nimphy 阅读(195) 评论(0) 推荐(0)
HDU1166 数状数组
摘要：敌兵布阵 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 99913 Accepted Submission(s): 42300 Problem 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(127) 评论(0) 推荐(0)
zoj 2136 Longest Ordered Subsequence 最长上升子序列 新思路
摘要：Longest Ordered SubsequenceTime Limit: 2 Seconds Memory Limit:65536 KB A numeric sequence of ai is ordered if a1 #include#include#includeusing na... 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(128) 评论(0) 推荐(0)
zoj3953 Intervals 最大不重叠区间加强版 zoj排名第一~
摘要：Chiaki has n intervals and thei-th of them is [li,ri]. She wants to delete some intervals so that there does not exist three intervalsa,b andc such th 阅读全文
posted @ 2017-09-27 21:06 nimphy 阅读(381) 评论(0) 推荐(0)

上一页 1 2