摘要: 1.树状数组在很多情况下可以替代线段树,而且树状数组的代码简洁好写,所以能用树状数组的地方我还是会树状数组而不是线段树; 2.树状数组的常用的函数有以下这些: 3.某些题目的区间修改可以改成点修改,然后区间查询如hdu1556,poj2155(二维的树状数组好神奇); 阅读全文
posted @ 2016-03-24 22:47 LittlePointer 阅读(142) 评论(0) 推荐(0) 编辑
摘要: 题目链接: Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 23170 Accepted: 8613 Description Given an N*N matrix A, whose elements are eit 阅读全文
posted @ 2016-03-24 22:02 LittlePointer 阅读(320) 评论(0) 推荐(0) 编辑
摘要: 题目链接: Color the ball Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14781 Accepted Submission(s) 阅读全文
posted @ 2016-03-24 20:34 LittlePointer 阅读(233) 评论(0) 推荐(0) 编辑
摘要: 题目链接: C. Subsequences time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output time limit per test 阅读全文
posted @ 2016-03-24 18:58 LittlePointer 阅读(447) 评论(0) 推荐(0) 编辑