摘要：
Flex动态创建多个曲线图+柱形图获取数据后的回调函数private function resultHandlerDay(event:ResultEvent):void {statisticCount = event.result.statistic.weekstatistic.length;var source:ArrayCollection = event.result.statistic.buildingtatistic;var seriesArr:Array = new Array();for(var i:Number = 0;i<source.length;i++){ var 阅读全文
阅读排行榜
用Mindmanager整理的VB常用函数
2011-02-09 15:20 by javaspring, 152 阅读, 收藏,
摘要：
用Mindmanager整理的VB常用函数概览：第一层完整版： 阅读全文
The Road Not Taken
2011-01-12 16:37 by javaspring, 152 阅读, 收藏,
摘要：
The Road Not Taken Robert FrostTwo roads diverged in a yellow wood,And sorry I could not travel bothAnd be one traveler, long I stoodAnd looked down one as for as I couldTo where it bent in the undergrowth;Then took the other, as just as fair,And having perhaps the better claim,Because it was grass. 阅读全文
SRM 498 div2
2012-07-30 20:32 by javaspring, 151 阅读, 收藏,
摘要：
250pt：题意：就是黑板上有三个数，有n次选择的机会，每次选择哪个数可以得到和那个数相同的分数，然后黑板上的该数减一。求n次选择最多能得到多少分。（注意分数减到0后就不在减）。思路：水题啊，每次选择时排序即可，选择最大的。代码：int getMaximumPoints(int A, int B, int C, int N) { int i,j,k; int sum = 0; int num[3] = {A,B,C}; for(int i = 1;i <= N; ++i){ sort(num,num+3); sum ... 阅读全文
POJ 2352 线段树
2012-04-18 15:55 by javaspring, 151 阅读, 收藏,
摘要：
题意就是让求在某个点左面的星星的个数。因为y是按升序输入的，所以只需要考虑x即可。此题可以用树状数组做，也可以用线段树做。以前用树状数组做过一次，这次用线段树又做了一下。相比来说，树状数组是比较容易想的，而且也更简单。 用线段树的话，当输入一个点的横坐标x后，考虑位于x左边的点有几个即可。题目：StarsTime Limit:1000MSMemory Limit:65536KTotal Submissions:20676Accepted:9015DescriptionAstronomers often examine star maps where stars are represente.. 阅读全文
浙公网安备 33010602011771号