Little Prince

You know — one loves the sunset, when one is so sad...

你知道的—当一个人情绪低落的时候,他会格外喜欢看日落......

If someone loves a flower, of which just one single blossom grows in all the millions and millions of stars, it is enough to make him happy just to look at the stars. He can say to himself, "Somewhere, my flower is there..." But if the sheep eats the flower, in one moment all his stars will be darkened... And you think that is not important!

倘若一个人对一朵花情有独钟,而那花在浩瀚的星河中,是独一无二的,那么,他只要仰望繁星点点,就心满意足了。他会喃喃自语:"我的花就在星河的某个角落......"可是,这花一旦被羊吃掉了,一瞬间,所有星星都将随之黯淡无光......那你也认为这不重要吗?

Flowers are so inconsistent! But I was too young to know how to love her...

花总是表里不一,而我太年轻了,不知道该怎样爱护她......

For she did not want him to see her crying. She was such a proud flower...

她其实是不愿意让小王子看到自己哭泣。她曾经是多么高傲的一朵花......

My flower is ephemeral, and she has only four thorns to defend herself against the world. And I have left on my planet, all alone!

我的花生命是短暂的,她只有四根刺可以保护自己,抵御世界,我却将她独自留在我的星球上了!

His flower had told him that she was only one of her kind in all universe. And here were five thousand of them, all alike, in one single garden!

他的花朵曾经告诉他,自己是宇宙间仅有的一种花;可是仅仅在这座花园里,就有五千朵和她一模一样的花!

I thought that I was rich, with a flower that was unique in all the world; and all I had was a common rose. A common rose...

我总以为自己很富有,拥有一朵世上独一无二的花;实际上,我所拥有的不过是一朵普通的玫瑰而已。一朵普通的玫瑰花......

To me, you are still nothing more than a little boy who is just like a hundred thousand other little boys. And I have no need of you. And you, on your part, have no need of me. To you, I am nothing more than a fox like a hundred thousand other foxes. But if you tame me, then we shall need each other. To me, you will be unique in all the world. To you, I shall be unique in all the world.

对我而言,你只是一个小男孩,和其他成千上万的小男孩没有什么不同。我不需要你。你也不需要我。对你而言,我也和其它成千上万的狐狸并没有差别。但是,假如你驯服了我,我们就彼此需要了。对我而言,你就是举世无双的;对你而言,我也是独一无二的......

The wheat fields have nothing to say to me. And that is sad. But you have hair that is the color of gold. Think how wonderful that will be when you have tamed me! The grain, which is also golden, will bring me back the thought of you. And I shall love to listen to the wind in the wheat.

麦田和我毫不相干,真令人沮丧。不过,你有金黄色的头发。想想看,如果你驯服了我,那该有多好啊!小麦也是金黄色的,那会使我想起你。我会喜欢听麦田里的风声......

It is your own fault, I never wished you any sort of harm; but you wanted me to tame you... but now you are going to cry! Then it has done you no good at all!

这是你的错,我根本无意伤害你,可是你却愿意让我驯服你......可是你现在却想哭!那驯服根本对你毫无好处!

It has done me good, because of the color of the wheat fields. Go and look again at the roses. You will understand now that yours is unique in all the world.

驯服对我是有好处的——因为麦田的颜色。再回头看那些玫瑰花吧!到时你就明白你的玫瑰花仍是举世无双的一朵花。

And now here is my secret, a very simple secret. It is only with the heart that one can see rightly; what is essential is invisible to the eyes.

这是我的一个秘密,再简单不过的秘密:一个人只有用心去看,才能看到真实。事情的真相只用眼睛是看不见的。

It is the time you have wasted for your rose that makes your rose so important.

你在你的玫瑰花身上耗费的时间使得你的玫瑰花变得如此重要。

Men have forgotten this truth. But you must not forget it. You become responsible, forever, for what you have tamed. You are responsible for your rose...

人们早已忘记了这个道理。可是你不应将它遗忘。你必须永远对自己所驯服的东西负责。你要对你的玫瑰花负责。

Only the children know what they are looking for. They waste their time over a rag doll and it becomes very important to them; and if anybody takes it away from them, they cry...

只有小孩子知道自己在找什么。他们把时间花费在布洋娃娃身上。因此对他们而言,洋娃娃就变得很重要。一旦有人将娃娃拿走,他们就会号啕大哭......

时间: 2024-10-22 23:14:15

Little Prince的相关文章

UVa 10635 - Prince and Princess

题目:在一个n*n的棋盘上,格子标号1~n*n,现在有两个人从1跳到n*n(不走重复点), 现在要求去掉最少的中间点,使得路径是一样的. 分析:dp,LIS,LCS.问题是求最大公共子序列,数据较大需要O(nlgn)算法. 发现题目中的数据是不重复的,所以可以转化成最大上升子序列: 记录序列1中每个元素对应的顺序,将序列2中的元素转化成对应序列1中的顺序标号: 那么,新构成的序列2中递增的序列即为序列1中的先后顺序,所以求出它的LIS即可. 说明:╮(╯▽╰)╭. #include <algor

HDU 4685 Prince and Princess

Prince and Princess Time Limit: 3000ms Memory Limit: 32768KB This problem will be judged on HDU. Original ID: 468564-bit integer IO format: %I64d      Java class name: Main There are n princes and m princesses. Princess can marry any prince. But prin

The Little Prince (1)

The Little Prince 2015-9-05 1.Word Magnificent 华丽的,壮丽的 Swallow 吞/燕子 Prey  捕食 Digestion     消化,领悟 Ponder  思考,仔细考虑 Masterpiece  杰作 Tiresome 烦人的,令人讨厌的 Distinguish  区别,辨别 Course  进程,路线 Consequence  后果,结论 Experiment 尝试/实验 Sensible  明智的,通情达理的 2.Thoughts <T

算法竞赛与入门经典---P66 [UVA 10635] Prince and Princess

Prince and PrincessInput: Standard Input Output: Standard Output Time Limit: 3 Seconds In an n x n chessboard, Prince and Princess plays a game. The squares in the chessboard are numbered 1, 2, 3 ... n*n, as shown below: Prince stands in square 1, ma

uva10635 Prince and Princess LCS 变 lIS

// uva10635 Prince and Princess LCS 变 lIS // 本意求LCS,但是规模有60000多,复杂度肯定不够 // 注意如果俩个序列的值的范围相同,那么可以在一个 // 串中记录在另外一个串中的位置.这样就可以转化成 // 最长上升子序列的问题啦,复杂度是nlogn,可以ac // 这题,还是挺有考究的价值的,很不错 // 哎,继续练吧..... #include <algorithm> #include <bitset> #include <

UVA10635 Prince and Princess(LIS)

题意:王子和公主同时从1出发走到 n*n, 求他们两个路径的最长公共子序列: 思路:因为这题n有250,如果用LCS负责度为O(n^2),容易超时,于是我们选择它的优化版Lis算法来求最长公共子序列,这样我们的复杂度就降为O(n*logn)了. Lis算法: 先回顾经典的O(n^2)的动态规划算法,设A[t]表示序列中的第t个数,F[t]表示从1到t这一段中以t结尾的最长上升子序列的长度,初始时设F[t] = 0(t = 1, 2, ..., len(A)).则有动态规划方程:F[t] = ma

HDU 4685 Prince and Princess(二分图 + 强连通)

Problem Description There are n princes and m princesses. Princess can marry any prince. But prince can only marry the princess they DO love. For all princes,give all the princesses that they love. So, there is a maximum number of pairs of prince and

uva 10635 Prince and Princess(DP)

uva 10635 Prince and Princess(DP) In an n x n chessboard, Prince and Princess plays a game. The squares in the chessboard are numbered 1, 2, 3 ... n*n, as shown below: Prince stands in square 1, make p jumps and finally reach square n*n. He enters a

UVa 10635 (LIS+二分) Prince and Princess

题目的本意是求LCS,但由于每个序列的元素各不相同,所以将A序列重新编号{1,2,,,p+1},将B序列重新编号,分别为B中的元素在A中对应出现的位置(没有的话就是0). 在样例中就是A = {1 7 5 4 8 3 9},B = {1 4 3 5 6 2 8 9} 重新编号以后: A = {1 2 3 4 5 6 7}, B = {1 4 6 3 0 0 5 7}(里面的0在求LIS时可以忽略) 这样求A.B的LCS就转变为求B的LIS 求LIS用二分优化,时间复杂度为O(nlogn) 第一次

LightOJ1012---Guilty Prince (并查集)

Once there was a king named Akbar. He had a son named Shahjahan. For an unforgivable reason the king wanted him to leave the kingdom. Since he loved his son he decided his son would be banished in a new place. The prince became sad, but he followed h