题目来源：http://acm.uestc.edu.cn/#/problem/show/4分析：就是一个很普通的区间修改，单点查询的树状数组，但是今天忘记吃药了，一直写不对，中午迷迷糊糊地，直接把数据读入到数组里而不是update，然后又总是考虑后面的数被减到0以下要怎么处理，其实根本不用考虑，直接...
分类：
其他好文 时间：
2014-07-27 23:27:59
阅读次数：
251
Say you have an array for which theithelement is the price of a given stock on dayi.Design an algorithm to find the maximum profit. You may complete a...
分类：
其他好文 时间：
2014-07-27 09:49:52
阅读次数：
237
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类：
其他好文 时间：
2014-07-26 14:30:11
阅读次数：
156
Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction ...
分类：
其他好文 时间：
2014-07-26 01:23:26
阅读次数：
229
Heap sort is common in written exams.First of all, what is heap? Heap is a kind of data struct that can be seen as a complete binary tree. The objectt...
分类：
其他好文 时间：
2014-07-26 00:13:06
阅读次数：
343
1.正常程序里的事务： using (System.Transactions.TransactionScope ts = new TransactionScope()) { try { //Sql语句 ts.Complete();//提交事务 } catch (Exception e) { Logg...
分类：
其他好文 时间：
2014-07-24 22:11:52
阅读次数：
171
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete as many transactions as you like (ie, buy on...
分类：
编程语言 时间：
2014-07-24 10:25:36
阅读次数：
227
Problem Description
Today the company has m tasks to complete. The ith task need xi minutes to complete. Meanwhile, this task has a difficulty level yi. The machine whose level below this task’s le...
分类：
其他好文 时间：
2014-07-23 16:36:41
阅读次数：
208
WHAT?提高代码运行速度的方法，减少代码的资源占用WHY?这里提出的都是“可以尝试的”方法，有的或许在你的环境根本不起作用，有的则能实实在在产生很好的效果HOW?Logic - 逻辑在知道答案后停止判断按照出现频率来调整判断顺序：让运行最快和判断结果最肯能为真的判断先行，即，让程序更容易进入常见状...
分类：
其他好文 时间：
2014-07-23 15:20:05
阅读次数：
201
一组外企iOS开发的笔试题，您能回答出来吗？从群里收集来的。1 why can't NSArray contain NSInteger Instance? with which extra step can you do it?2.complete this code so that it beco...
分类：
移动开发 时间：
2014-07-23 12:08:16
阅读次数：
240
