LIfe is about making an impact, not making an income. 生命在于影响他人,而非赚钱糊口. From Kevin Kruse. You probably argue that one must make an income first, then if he has some extra power while earning a not bad life, he can try to pursue some impacts on the wor…

Knowledge makes humble, ignorance makes proud. 博学使人谦逊,无知使人骄傲. Humility is not equal with being passive, submissive or insecure, instead, humility means being confident and being competent. Humble people always seek to self-actualize by helping themse…

Great minds think alike. 英雄所见略同. If great minds really did think alike, then we would live in an unreal world which is just a Dstopia. Given that our world is so varied, so I think the great minds don't think alike, though there might be only one tru…

A good beginning is half done. 良好的开端是成功的一半. We can't finish anything if we don't start, sometimes getting started might be the hardest part of the whole process. Get a good start on a project and the rest of it may fall into their own places naturall…

Don't cry for what is lost. Smile for what still remains. 别为失去的哭泣,为还留在你身边的一切微笑吧. I have been told that if crying for missing the sun, we may miss the chance to see the beautiful stars as well. Life would never give us the second time to get something…

Grasp all, lose all. 欲尽得,必尽失. Not to be greedy and not to try to get everything. Our time, energy and wisdom are all limited, if we want too much, we probably get nothing eventually, so why not hold our own in our real inclination, and place single-m…

Hope clouds observation. 心怀希望会蒙蔽双眼,影响判断. Almost every of us thinks we would be the master of our lives and live the life we are longing to live. I used to think in that way so. But that was the past. Because I have learned that I am just an ordinary…

题意:两地之间有n条不相交路径,第i条路径由a[i]座桥组成,每座桥有一个损坏概率,让你确定一个对所有桥的检测顺序,使得检测所需的总期望次数最小. 首先,显然检测的时候,是一条路径一条路径地检测,跳跃地检测没有意义.考虑已经排好的某个路径的顺序,相邻的两条路径j和j+1如果满足: (route[j].A+route[j].B)+(route[j+1].A+route[j+1].B)*(1.0-route[j].c)> (route[j].A+route[j].B)*(1.0-route[j+1]…

题意:平面上n个点,每个点带有一个或正或负的权值,让你在平面上放一个内边长为2l,外边长为2r的正方形框,问你最大能圈出来的权值和是多少? 容易推出,能框到每个点的 框中心 的范围也是一个以该点为中心的相同大小的框. 于是,把每个点的框拆成4条线.从下往上扫过去,最下面的线,给[R,R]区间加上该点的权值,然后上面再给[L,L]减去,然后上面再给[L,L]加上,然后再往上在给[R,R]减去即可.每次扫完一行,就用线段树的全局最大值尝试更新答案. 两个坑点:首先,由于线段树里存储的是离散后的点,所…

Full of luck, health and cheer. We wish you a Happy Chinese New Year! 春节快乐,万事如意! From Shanbay. Today is the Chinese New Year of 2018. Wish every of us a Happy New Year. We will open a new book today, we will forget all our worries today. A new year a…