Run ID | User | Problem | Result | Memory | Time | Language | Code Length | Submit Time |
3951898 | slxg | 1195 | Accepted | 5032K | 422MS | Pascal | 1128B | 2008-08-23 11:00:39 |
3951879 | slxg | 1195 | Accepted | 5032K | 329MS | Pascal | 1115B | 2008-08-23 10:56:57 |
3951861 | slxg | 1195 | Time Limit Exceeded | Pascal | 1094B | 2008-08-23 10:54:28 |
一般的二維樹狀數組的題
所謂二維樹狀數組~其實就是一維裏面再嵌套一個~其他更高維也是如此~
就像這樣:
- begin
- xx:=x;
- while xx<=n do begin
- yy:=y;
- while yy<=n do begin
- inc(a[xx,yy],del);
- yy:=yy+lowbit(yy);
- end;
- xx:=xx+lowbit(xx);
- end;
- end;
其實不難哈~
要注意的是題目中的x,y是從0開始的 讀入後要加1~
不然會死循環~TLE
還有lowbit加inline 就好了哈~其他的加反而更慢~