z*7
2 楼
下班前发个好玩的.
p*2
3 楼
【 以下文字转载自 Sex 讨论区 】
发信人: saxi (5个包子), 信区: Sex
标 题: 他们
发信站: BBS 未名空间站 (Thu Jun 19 23:42:14 2008)
不是高考作文,只是淡淡讲几个男人的故事,看到版上男人多,随意间想起来的,虽然跟版旨不太切合。
1.
谭天初三毕业之前还是乳臭未干的黄毛小子,没长开,不起眼。但是初三毕业后的那个暑假,竟然一下子窜过一米八,模样周正起来。于是秋后刚进高中,就成了女生们议论的话题。但是谭天并不以此为契机 -- 有女生找借口接近他,他却觉得别扭,甚至紧张,敬而远之-- 谭天不喜欢女生,特别是那些学习好的女生,因为谭天心里有阴影,他从小就被那些爱听老师话的女生们欺负,她们喜欢管教他上课要听讲,喜欢告状他满口冒脏话,喜欢嘲笑他写字像狗爬,她们喜欢对他做很多事,唯独没有打心眼里真正喜欢他这个人。从来不喜欢听讲的谭天,曾在数学课上私下里做过统计,在他所认识的女生范围内,美女指数跟考试分数是显著的负相关,于是,谭天开始后悔自己阴差阳错进了重点高中。
谭天个子高,坐在教室最后一排,几大摞书厚厚地往桌前一搁,碉堡似的,可以安心打盹儿
发信人: saxi (5个包子), 信区: Sex
标 题: 他们
发信站: BBS 未名空间站 (Thu Jun 19 23:42:14 2008)
不是高考作文,只是淡淡讲几个男人的故事,看到版上男人多,随意间想起来的,虽然跟版旨不太切合。
1.
谭天初三毕业之前还是乳臭未干的黄毛小子,没长开,不起眼。但是初三毕业后的那个暑假,竟然一下子窜过一米八,模样周正起来。于是秋后刚进高中,就成了女生们议论的话题。但是谭天并不以此为契机 -- 有女生找借口接近他,他却觉得别扭,甚至紧张,敬而远之-- 谭天不喜欢女生,特别是那些学习好的女生,因为谭天心里有阴影,他从小就被那些爱听老师话的女生们欺负,她们喜欢管教他上课要听讲,喜欢告状他满口冒脏话,喜欢嘲笑他写字像狗爬,她们喜欢对他做很多事,唯独没有打心眼里真正喜欢他这个人。从来不喜欢听讲的谭天,曾在数学课上私下里做过统计,在他所认识的女生范围内,美女指数跟考试分数是显著的负相关,于是,谭天开始后悔自己阴差阳错进了重点高中。
谭天个子高,坐在教室最后一排,几大摞书厚厚地往桌前一搁,碉堡似的,可以安心打盹儿
m*s
4 楼
【 以下文字转载自 board 讨论区 】
发信人: wuchang (wuchang), 信区: board
标 题: 申请 BuildingWeb 网站建设版 版主
发信站: BBS 未名空间站 (Mon Jan 25 22:14:36 2010, 美东)
ID: wuchang
申请职务:网站建设版 版主
理由:我本人有丰富的编程经验和少量的网站建设/推广经验。也有充裕的上网时间。我想利用我的经验、热情为大家服务,促进网站建设爱好者之间的经验交流,提升网站建设版
的人气。
日期: Jan 26, 2010
发信人: wuchang (wuchang), 信区: board
标 题: 申请 BuildingWeb 网站建设版 版主
发信站: BBS 未名空间站 (Mon Jan 25 22:14:36 2010, 美东)
ID: wuchang
申请职务:网站建设版 版主
理由:我本人有丰富的编程经验和少量的网站建设/推广经验。也有充裕的上网时间。我想利用我的经验、热情为大家服务,促进网站建设爱好者之间的经验交流,提升网站建设版
的人气。
日期: Jan 26, 2010
s*s
5 楼
Binary Search on 2D Array
How do you apply Binary Search on 2D array supposed you have 2D array with
integers sorted both horizontally and vertically. If you find any occurrence
of the value you are looking for you return true else false. What is the
complexity?
For example the 2D array could look like the following
1 4 5 6
2 5 7 9
3 8 10 11
6 9 12 20
How do you apply Binary Search on 2D array supposed you have 2D array with
integers sorted both horizontally and vertically. If you find any occurrence
of the value you are looking for you return true else false. What is the
complexity?
For example the 2D array could look like the following
1 4 5 6
2 5 7 9
3 8 10 11
6 9 12 20
r*y
6 楼
有什么新功能吗
这些软件真是庞然大物啊
这些软件真是庞然大物啊
y*h
7 楼
rt
n*s
8 楼
http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?tp=&arnumber=4384389&isnumber=4384380
Novel Package Technology of Ultra High Power Light-Emitting Diodes by
Electroplating
Compound Semiconductor Integrated Circuit Symposium, 2007. CSIC 2007. IEEE
Publication Date: 14-17 Oct. 2007
On page(s): 1-4
Location: Portland, OR, USA,
ISBN: 978-1-4244-1023-1
Digital Object Identifier: 10.1109/CSICS07.2007.9
全文链接见所示的link
n***********[email protected]
thanks
Novel Package Technology of Ultra High Power Light-Emitting Diodes by
Electroplating
Compound Semiconductor Integrated Circuit Symposium, 2007. CSIC 2007. IEEE
Publication Date: 14-17 Oct. 2007
On page(s): 1-4
Location: Portland, OR, USA,
ISBN: 978-1-4244-1023-1
Digital Object Identifier: 10.1109/CSICS07.2007.9
全文链接见所示的link
n***********[email protected]
thanks
g*e
9 楼
哈哈,这个好玩。
h*6
10 楼
support
h*e
11 楼
This is a classic problem. Binary search doesn't really help you in terms of
comlexity. Finding an element in the nxn sorted matrix is Theta(n) using
the diagonal method.
occurrence
【在 s*******s 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: Binary Search on 2D Array
: How do you apply Binary Search on 2D array supposed you have 2D array with
: integers sorted both horizontally and vertically. If you find any occurrence
: of the value you are looking for you return true else false. What is the
: complexity?
: For example the 2D array could look like the following
: 1 4 5 6
: 2 5 7 9
: 3 8 10 11
: 6 9 12 20
comlexity. Finding an element in the nxn sorted matrix is Theta(n) using
the diagonal method.
occurrence
【在 s*******s 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: Binary Search on 2D Array
: How do you apply Binary Search on 2D array supposed you have 2D array with
: integers sorted both horizontally and vertically. If you find any occurrence
: of the value you are looking for you return true else false. What is the
: complexity?
: For example the 2D array could look like the following
: 1 4 5 6
: 2 5 7 9
: 3 8 10 11
: 6 9 12 20
c*p
13 楼
明显没有你帅阿
w*g
14 楼
晕。老黄历了,过期了已经。
s*s
15 楼
Could you please give an example of the diagonal method? For example, how to find 6 in the array? Thanks.
of
【在 h*******e 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: This is a classic problem. Binary search doesn't really help you in terms of
: comlexity. Finding an element in the nxn sorted matrix is Theta(n) using
: the diagonal method.
:
: occurrence
of
【在 h*******e 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: This is a classic problem. Binary search doesn't really help you in terms of
: comlexity. Finding an element in the nxn sorted matrix is Theta(n) using
: the diagonal method.
:
: occurrence
s*s
24 楼
Let me formalize it a bit.
2D array: A[0..n-1, 0..n-1]
Target value: v
Start from bottom left corner. Only movements of up and right are allowed.
Let the array value of current position be a.
do the following:
if a>v, move up;
if a until find v or hitting the right or top side of the array.
Is it the same to start from top right corner and do the following movement?
if a>v, move left;
if a until find v or hit the bottom or left side of the array.
【在 h********g 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: start from bottom left corner, let the value be v,
: if xv, move left
2D array: A[0..n-1, 0..n-1]
Target value: v
Start from bottom left corner. Only movements of up and right are allowed.
Let the array value of current position be a.
do the following:
if a>v, move up;
if a
Is it the same to start from top right corner and do the following movement?
if a>v, move left;
if a
【在 h********g 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: start from bottom left corner, let the value be v,
: if x
相关阅读
control conference 审稿机会工作机会, 快速发展半导体公司请发私信给我。多谢多谢职位内推:自动驾驶(算法/软件)工程师前辈请谈谈信号完整性工程师的发展前景朋友startup小公司招聘模拟电路设计工程师,layout工程师,实Broadcom Memory Design Irvine内推大家说说做nanodevice的博士毕业了干啥子《Advanced Materials》 , 2016 , 28 (38) :8463-8468 单层MoSRF engineer 内推机会阴狠的华人大学教授UT Arlington 招收数名机器学习数据挖掘全奖博士生有招post doc的吗?电磁计算仿真方面的OLED Engineer Hiring (转载)为什么都推荐转码,而不是转金融brcm 做WiFi的central engineering谁能解释下为什么AMD的PE这么高?中国航天科工集团三O六研究所通信PhD申CS(CV/ML)方向博后可行吗?博后做完之后在该方向上竞job opening