树状数组 - 随笔分类 - ERKE

Rabbit Kingdom hdu 4777 树状数组

只有注册用户登录后才能阅读该文。

posted @ 2014-09-19 20:44 ERKE 阅读(0) 评论(0) 推荐(0)

数表莫比乌斯函数

只有注册用户登录后才能阅读该文。

posted @ 2014-09-07 10:32 ERKE 阅读(0) 评论(0) 推荐(0)

Palindrome

只有注册用户登录后才能阅读该文。

posted @ 2014-08-25 21:23 ERKE 阅读(3) 评论(0) 推荐(0)

Dynamic Inversions II 逆序数的性质树状数组求逆序数

摘要：Dynamic Inversions IITime Limit:6000/3000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem Description给出N个数a[1],a[2] ... a[... 阅读全文

posted @ 2014-07-24 23:43 ERKE 阅读(256) 评论(0) 推荐(0)

Dynamic Inversions 50个树状数组

摘要：Dynamic InversionsTime Limit:30000/15000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem Description给出N个数a[1],a[2] ... a[N... 阅读全文

posted @ 2014-07-23 19:42 ERKE 阅读(192) 评论(0) 推荐(0)

Liers 树状数组+中国剩余定理

摘要：LiersTime Limit:14000/7000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem Description有N个人，其中有若干个人一起参加了舞会，现在想知道哪些人有可能参加了舞会... 阅读全文

posted @ 2014-07-18 15:54 ERKE 阅读(183) 评论(0) 推荐(0)

Crayon 线段树或者树状数组

摘要：CrayonTime Limit:2000/1000MS (Java/Others)Memory Limit:128000/64000KB (Java/Others)SubmitStatusProblem DescriptionBackgroundMary love painting so much... 阅读全文

posted @ 2014-07-18 10:29 ERKE 阅读(394) 评论(0) 推荐(0)

Disharmony Trees 树状数组

摘要：Disharmony TreesTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64uSubmitStatusDescriptionOne day Sophia finds a very big square. There... 阅读全文

posted @ 2014-07-14 15:36 ERKE 阅读(275) 评论(0) 推荐(0)

Cow Sorting hdu 2838

摘要：Cow SortingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2224Accepted Submission(s): 701Problem ... 阅读全文

posted @ 2014-07-11 14:51 ERKE 阅读(276) 评论(0) 推荐(0)

1523. K-inversions URAL 求k逆序对，，，，DP加树状数组

摘要：1523. K-inversionsTime limit: 1.0 secondMemory limit: 64 MBConsider a permutationa1,a2, …,an(allaiare different integers in range from 1 ton). Let us callk-inversiona sequence of numbersi1,i2, …,iksuch that 1≤i1ai2>…>aik. Your task is to evaluate the number of differentk-inversions in a given 阅读全文

posted @ 2014-03-03 13:20 ERKE 阅读(343) 评论(0) 推荐(0)

hdu1556树状数组的区间更新单点查询

摘要：Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6084Accepted Submission(s): 3227 Problem DescriptionN个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a 2 #include 3 #include 4 #include 5 #include 6 using namespace std; 7 int a[1000000]; ... 阅读全文

posted @ 2013-08-14 13:04 ERKE 阅读(166) 评论(0) 推荐(0)

poj3468树状数组的区间更新，区间求和

摘要：A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 47174Accepted: 13844Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a g. 阅读全文

posted @ 2013-08-14 09:02 ERKE 阅读(563) 评论(0) 推荐(0)

poj2155一个二维树状数组

摘要：MatrixTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 15125Accepted: 5683DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 2 #include 3 #include 4 #include 5 #include 6 using n... 阅读全文

posted @ 2013-08-14 08:53 ERKE 阅读(158) 评论(0) 推荐(0)

随笔分类 - 树状数组