- 博客(4)
- 收藏
- 关注
RSS订阅原创 poj 2155 Matrix
题意：给你一个n×n的01矩形，初始值全为0，并要你进行几个操作：1.对子矩阵(x1,y1,x2,y2)进行反选; 2.询问(x,y)的值; 二维树状数组的思路并不难想到，但是这题和一般的二维树状数组有点不一样，这题是修改区间，询问点。于是我们便可以用getsum修改，用update查询； 代码如下：{$inline on} var a:array[1..1024,1..1024]of boo
2013-11-28 14:09:07
476
原创 bzoj3315 [Usaco2013 Nov]Pogo-Cow
Description In an ill-conceived attempt to enhance the mobility of his prize cow Bessie, Farmer John has attached a pogo stick to each of Bessie's legs. Bessie can now hop around quickly througho
2013-11-27 13:46:23
1044
原创 bzoj3312 [Usaco2013 Nov]No Change
Description Farmer John is at the market to purchase supplies for his farm. He has in his pocket K coins (1 <= K <= 16), each with value in the range 1..100,000,000. FJ would like to make a seque
2013-11-25 17:43:31
799
原创 [Usaco2013 Nov]Crowded Cows
Description Farmer John's N cows (1 <= N <= 50,000) are grazing along a one-dimensional fence. Cow i is standing at location x(i) and has height h(i) (1 <= x(i),h(i) <= 1,000,000,000). A cow feels
2013-11-24 17:20:30
782
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人