zoukankan      html  css  js  c++  java
  • March 28 2017 Week 13 Tuesday

    Never was anything great achieved without danger.

    不经历风雨,又怎能见彩虹。

    After the rain, if there's the sunshine, then we may see the beautiful rainbow, one natural phenomenon, formed by the water vapour in the air reflects the sunshine.

    Red, orange, yellow, green, blue, indigo, violet, very beautiful.

    Yes, the one thing I'd like to highlight is that we may see the rainbow, not we always see the rainbow.

    All things in the world run in this way, you can't make sure it will be certain to happen even if all the requirements are met.

    So, I just want to comfort myself if the outcomes are not as good as we had expected.

    That just shows one thing, the time is yet to come and we'd better to do more to assure all the requirements are met, sometimes we must make sure they are excessive, with enough margin.

    Instead of worrying about what you cannot control, shift your energy to what you can create.

    与其担心你无法掌控的,不如将精力花在你能创造的东西上面。

    Recently I am very anxious, because I haven't abtained the things I had promised to others and I had expected Iwould have before the deadline.

    Some of them are out of my control, I only can make sure what I have done, but I can't guarantee the results.

    And I spend too much time in worrying about the results and imagining what my life will be if they are good or if they are bad.

    Useless, isn't it?

    Maybe it will be better if I can shift those time and energy to what I can create now, for example, I can spend more time on optimizing my code to make the performance of my system better and more reliable.

    Ok, I always know what the problems lie, the very thing I need to do is insisting on solving the problems and eradicate the bugs.

  • 相关阅读:
    在 Java SE 6 中监视和诊断性能问题
    Codeforces Round #491 (Div. 2)部分题解
    BZOJ1607: [Usaco2008 Dec]Patting Heads 轻拍牛头(模拟 调和级数)
    BZOj1261: [SCOI2006]zh_tree(dp)
    BZOJ1569: [JSOI2008]Blue Mary的职员分配(dp 暴力)
    BZOJ4300: 绝世好题(dp)
    树上莫队算法
    SPOJ COT2
    BZOJ1086: [SCOI2005]王室联邦(贪心,分块?)
    Educational Codeforces Round 42 (Rated for Div. 2)
  • 原文地址:https://www.cnblogs.com/dengwenwu/p/6938307.html
Copyright © 2011-2022 走看看