Description
A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal ...
分类：
其他好文 时间：
2015-08-15 18:27:35
阅读次数：
153
learning by doing, recently i'm learning English, and maybe from now on, i'll post article in English (if possible).in the very beginning, it may diff...
分类：
移动开发 时间：
2015-08-15 13:14:18
阅读次数：
221
创建vm常用的vm有VMwear和virtualbox两种方式，VMwear是收费的，virtualbox免费的。安装centeros分区时，swap的大小，如果内存小于4g就是本身内存的2倍，swap最好不要超过8g选择终端是选择minimal，安装服务时最好装上开发工具。注意设置ISO文件的路径，显示器最好调节800*600..
分类：
系统相关 时间：
2015-08-14 19:33:13
阅读次数：
154
Given several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would completely cov...
分类：
其他好文 时间：
2015-08-09 22:21:45
阅读次数：
146
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return
0 instead.
For example, given the array [2,3...
分类：
其他好文 时间：
2015-08-08 12:11:52
阅读次数：
168
Given several segments of line (int the X axis) with coordinates [Li , Ri ]. You are to choose the minimal amount of them, such they would completely ...
分类：
其他好文 时间：
2015-08-07 21:58:11
阅读次数：
137
原题：The ProblemGiven several segments of line (int the X axis) with coordinates [Li,Ri]. You are to choose the minimal amount of them, such they would ...
分类：
其他好文 时间：
2015-08-07 21:49:13
阅读次数：
106
当前环境：centos6.5_64-minimal先安装gcc和gcc-c++[root@localhost~]#rpm-qa|grepgcc
libgcc-4.4.7-11.el6.x86_64
[root@localhost~]#yuminstall-ygccgcc-c++#安装gcc，gcc-c++才可以编译安装后面高版本gcc
[root@localhost~]#rpm-qa|grepgcc
libgcc-4.4.7-11.el6.x86_64
gcc-..
分类：
其他好文 时间：
2015-08-07 20:24:36
阅读次数：
107
Given several segments of line (int the X axis) with coordinates [Li , Ri ]. You are to choose the minimal amount of them, such they would completely ...
分类：
其他好文 时间：
2015-08-06 22:10:06
阅读次数：
100
