[转]当代大学生,没我们想象的那么堕落

杰拉斯 杰拉斯 | 时间:2012-03-06, Tue | 5,417 views
心路历程 

近十年来,社会给当代大学生很多负面评价,说他们是垮掉的一代、迷惘的一代、没有责任感、没有使命感、急功近利、蝇营狗苟的一代。或许这些负面的特征他们确实具有。 但我们做平心之论,这些特征难道是他们独有的吗?

赶上文革结束后头班车进城的大学生难道就没有这些问题,为了获得一张进城的车票,他们会拿着高考复习资料背着昔日的手足兄弟躲到密林蒿草里去苦读(见刘震云小说《塔铺》)。这不是自私是什么?很多人一进城一上大学就抛弃了乡下的患难之交糟糠之妻,这不是背信弃义是什么?我们原谅70年代大学生的一些不轨行为,缘于对他们遭受了太多的苦难的同情。

80年代的大学生还是社会的宝贝,还是天之骄子,他们一面受着启蒙思想的滋养,积极干世,充满了批判精神和参与意识,同时他们又深受欧风美雨的洗礼,他们反传统道德、否定传统的价值观、将骑在传统的脖子上撒野视为潇洒。我们尽管对他们的行为充满惶惑和恐惧但最终还是以改革的名义接受了他们。

90年代后期的大学生最苦,他们目送免费公派的师兄师姐潇洒而去,自己却要承担昂贵的学费和沉重的就业压力。无节制的高校扩招又让他们丧失了天之骄子的光环。他们失去太多,社会却没有给他们以应有抚慰和疏导,却一味的责怪他们的浮躁和喧嚣。久经磨练的成人尚且不堪如此变化,何况少不更事的莘莘学子。现时代的大学生和90年代后期的大学生生存环境基本相似,但大学学历更加贬值,就业压力更大,就业环境更加严峻。好在经历了上十年的残酷现实的教育,大学生已渐渐习惯被社会边缘化的事实。大学生是什么,他们清醒自己不再是什么天之骄子,他们也不够以知识分子相称,社会没有要他们参与批判和质疑,充其量他们只是有点知识的待业者。改革二十年的成果没让他们充分分享,但改革的沉重包袱却毫不犹豫地让他们去背负。他们比任何时代的学生承当的压力都大,他们没有遭遇主流舆论提及的机遇。生存的哲学变得越来越坚硬。

(阅读全文…)

[整理]ACM详解(9)——其他

杰拉斯 杰拉斯 | 时间:2012-02-17, Fri | 5,366 views
编程算法 
有时候会考一些锻炼基本能力的题目,下面使用几个例子进行简单分析。
1IP Address
Description
Suppose you are reading byte streams from any device, representing IP addresses. Your task is to convert a 32 characters long sequence of '1s' and '0s' (bits) to a dotted decimal format. A dotted decimal format for an IP address is form by grouping 8 bits at a time and converting the binary representation to decimal representation. Any 8 bits is a valid part of an IP address. To convert binary numbers to decimal numbers remember that both are positional numerical systems, where the first 8 positions of the binary systems are:
27 26 25 24 23 22 21 20
128  64 32 16 8   4   2   1
Input
The input will have a number N (1<=N<=9) in its first line representing the number of streams to convert. N lines will follow.
Output
The output must have N lines with a doted decimal IP address. A dotted decimal IP address is formed by grouping 8 bit at the time and converting the binary representation to decimal representation.

(阅读全文…)

[整理]ACM详解(8)——加密

杰拉斯 杰拉斯 | 时间:2012-02-17, Fri | 6,061 views
编程算法 
比赛的时候告诉你简单的加密算法,让你完成加密或者解密操作,下面通过几个简单例子介绍。
1Message Decowding
Description
The cows are thrilled because they've just learned about encrypting messages. They think they will be able to use secret messages to plot meetings with cows on other farms.
Cows are not known for their intelligence. Their encryption method is nothing like DES or BlowFish or any of those really good secret coding methods. No, they are using a simple substitution cipher.
The cows have a decryption key and a secret message. Help them decode it. The key looks like this:
yrwhsoujgcxqbativndfezmlpk
Which means that an 'a' in the secret message really means 'y'; a 'b' in the secret message really means 'r'; a 'c' decrypts to 'w'; and so on. Blanks are not encrypted; they are simply kept in place.
Input text is in upper or lower case, both decrypt using the same decryption key, keeping the appropriate case, of course.
Input
* Line 1: 26 lower case characters representing the decryption key
* Line 2: As many as 80 characters that are the message to be decoded
Output
* Line 1: A single line that is the decoded message. It should have the same length as the second line of input.

(阅读全文…)

[整理]ACM详解(7)——压缩与编码

杰拉斯 杰拉斯 | 时间:2012-02-17, Fri | 6,017 views
编程算法 

有些题目会给出一些简单的压缩方法或者编码方法,让你实现具体的算法。下面通过题目分析。

1Parencodings
Description
Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways:
By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right parenthesis in S (P-sequence).
By an integer sequence W = w1 w2...wn where for each right parenthesis, say a in S, we associate an integer which is the number of right parentheses counting from the matched left parenthesis of a up to a. (W-sequence).
Following is an example of the above encodings:
S                 (((()()())))
P-sequence          4 5 6666
W-sequence         1 1 1456
Write a program to convert P-sequence of a well-formed string to the W-sequence of the same string.
Input
The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case is an integer n (1 <= n <= 20), and the second line is the P-sequence of a well-formed string. It contains n positive integers, separated with blanks, representing the P-sequence.
Output
The output file consists of exactly t lines corresponding to test cases. For each test case, the output line should contain n integers describing the W-sequence of the string corresponding to its given P-sequence.

(阅读全文…)