- 博客(2)
- 资源 (25)
- 收藏
- 关注
RSS订阅原创 OJ-位图算法
题目描述：位图法就是bitmap的缩写，是用每一个bit位来存放某种状态，适用于大规模数据的查找和排序。位图算法称的上是最简单的算法，只需要一个for循环就能够搞定排序和查找，但是同时它也是对待操作的数据要求最苛刻的，首先这些数据必须是正整数，且数据不能重复，其次要大致知道这些数据的范围，且有一定的聚集性。数据结构为：unsigned int bitmap[N] ，其可以表示的数据范围是
2017-05-14 20:30:35
534
原创 OJ题-营救公主
题目描述如下：题面：500年前，Jesse是我国最卓越的剑客。他英俊潇洒，而且机智过人^_^。突然有一天，Jesse心爱的公主被魔王困在了一个巨大的迷宫中。Jesse听说这个消息已经是两天以后了，他知道公主在迷宫中还能坚持T天，他急忙赶到迷宫，开始到处寻找公主的下落。时间一点一点的过去，Jesse还是无法找到公主。最后当他找到公主的时候，美丽的公主已经死了。从此Jesse郁郁寡欢，
2017-05-13 00:46:48
5253
Convex Optimization
Convex optimization problems arise frequently in many different fields. This book provides a comprehensive introduction to the subject, and shows in detail how such problems can be solved numerically with great efficiency. The book begins with the basic elements of convex sets and functions, and then describes various classes of convex optimization problems. Duality and approximation techniques are then covered, as are statistical estimation techniques. Various geometrical problems are then presented, and there is detailed discussion of unconstrained and constrained minimization problems, and interior-point methods. The focus of the book is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance and economics.
2016-09-02
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人