针对2014 ACM/ICPC 北京赛区网络赛邀请赛(9月21日)，本日志汇总网上ACMer们发布的解题报告，方便大家互相学习。欢迎补充和完善本日志。
感谢所有及时发布解题报告，和大家分享知识的各位神牛。
题目地址
1001. Always Cook Mushroom (hdu 5032 )
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1002. Building (hdu 5033 )
http://www.shuizilong.com/house/archives/2014-acmicpc-asia-regional-beijing-online/
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1003. Cowboy (hdu 5034 )
1004. Delivery (hdu 5035 )
https://www.zybuluo.com/rihkddd/note/34286
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1005. Explosion (hdu 5036 )
http://www.shuizilong.com/house/archives/2014-acmicpc-asia-regional-beijing-online/
http://metthesoul.blog.163.com/blog/static/230320036201482242456608/
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1006. Frog (hdu 5037 )
http://blog.csdn.net/alpc_paul/article/details/39457193
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1007. Grade (hdu 5038 )
http://chengzi.aemiot.com/hdu-5038.html
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1008. Hilarity (hdu 5039 )
http://www.shuizilong.com/house/archives/2014-acmicpc-asia-regional-beijing-online/
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1009. Instrusive (hdu 5040 )
http://chengzi.aemiot.com/hdu-5040.html
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
1010. Just A Challenge (hdu 5041 )
You can follow any responses to this entry through the RSS 2.0 You can skip to the end and leave a response. Pinging is currently not allowed.
贡献一个1004题解：https://www.zybuluo.com/rihkddd/note/34286
frog 感觉写的还不错，思路也挺清晰
http://blog.csdn.net/alpc_paul/article/details/39457193
1007 Grade http://chengzi.aemiot.com/hdu-5038.html 求过
1005 : http://metthesoul.blog.163.com/blog/static/230320036201482242456608/
再来一发 1009写了五个小时，就是因为坑爹的理解错了摄像头的range。。。。http://chengzi.aemiot.com/hdu-5040.html
A题将（0， 0）到（1000， 1000）内的所有点以及询问按照极坐标排序，依次插入／查询以x轴为关键字的树状数组即可。
另外，可以使用法雷序列生成（0， 0）到（1000， 1000）以内的坐标，这样就可以省去排序的时间。单组数据较使用排序的解法快4倍至8倍左右。
http://sd-invol.github.io/2014/09/22/Beijing-2014-Online/
除CJ