2013年12月_PK0071

转载加载性能优化ViewHolder

在android开发中Listview是一个很重要的组件，它以列表的形式根据数据的长自适应展示具体内容,用户可以自由的定义listview每一列的布局，但当listview有大量的数据需要加载的时候，会占据大量内存，影响性能，这时候就需要按需填充并重新使用view来减少对象的创建。ListView加载数据都是在public View getView(int position, View c

2013-12-31 13:09:04 756

原创 ACM Regionals 2004 Europe - Southeastern 最大子矩阵(扫描法)

Bob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees, factories and buildin

2013-12-30 23:15:47 1216

原创 android应用启动页面显示

腾讯QQ，微博，大部分的应用启动的一个页面都是显示自己logo，不但可以打下广告还可以掩饰后台加载的行为，今天想在自己的应用加上，去网上搜索了一下，找到了一个比较实用的案例，使用handle和thread来计时显示，修改了一下就用上了。Splash.javapackage com.vae;import android.app.Activity;import android.conte

2013-12-23 18:52:55 1405

原创 04年中欧ACM比赛

Beijing was once surrounded by four rings of city walls: the Forbidden City Wall, the Imperial City Wall, the Inner City Wall, and finally the Outer City Wall. Most of these walls were demolished in t

2013-12-21 00:46:11 1208

原创 2007LA 3902 网络(树+贪心)

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=283&page=show_problem&problem=1903题意：在一个树状的网络中，提供VOD服务，叶子节点是客户端，其他是服务器，要减少网络延迟，所以要在其他的服务器也安装同样的服务，使得每台客户端到最近服务器的

2013-12-10 23:41:30 923

原创 UVa 11520 填充正方形

In this problem, you have to draw a square using uppercase English Alphabets.To be more precise, you will be given a square grid with some empty blocks and others already filled for you with some le

2013-12-08 23:00:23 942

原创 2006 ACM Northwestern European Programming Contest C题(二分求最大)

My birthday is coming up and traditionally I'm serving pie. Not just one pie, no, I have a numberN of them, of various tastes and of various sizes. F of my friends are coming to my party and each of

2013-12-08 22:59:46 996

原创 2007年北欧ACM比赛A题(最小值最大，二分)

Problem A - AssembleTime limit: 2 secondsRecently your team noticed that the computer you use to practice for programming contests is not good enough anymore. Therefore, you decide to buy a new co

2013-12-08 00:08:07 1543

原创 UVa11384正整数序列(递归，二分)

题目大意：有一个从1、2、3、.......n的正整数数列，现在要通过若干次操作将这个数列全部变为0，操作的方法是每次选取任意1个或多个任意位置的数，然后将这几个数同时减去一个一个数。问至少要经过多少次操作才能让数列全部变为0思路：在纸上试几个数就可以发现，比如6时，456同时减去4这个中间数，剩下123012其实只取决于123这部分f(6) = f(3) + 1。

2013-12-08 00:06:47 1244

Java#