On road again, 2015

简介:

Actually, I've disappeared a long time almost 4 years.

Hope that I could start to write what I really want to say and think and share what I do and feel.

What's my plan next? 

  1. Create a blog wetsibe of myself.

  2. Focus on architecture of IT and managment. BTW, clouding time is comming, but I'm not sure AWS will be better and better in China. I know you can guess why I said that.

  3. Pursue different my own life, work is not important part of my life. -:). So maybe I'll share more what I like to do, say to English culture and etc.

  4. More sports. In my view, sport is not only health for your body but it's the attuitude of my life. Yea, For challenging, quantification of target whcih my physical exercise is necessary. Like freestyle swimming  that I could swim 1000m no more than 30m -:)


I'll write my plan or wish list of new year in days.


On road again, I'm comming 2015.

本文转自Be the miracle!博客51CTO博客,原文链接http://blog.51cto.com/miracle/1598256如需转载请自行联系原作者


Larry.Yue

目录
打赏
0
0
0
0
90
分享
相关文章
|
9月前
|
Cartesian product
【7月更文挑战第5天】
93 0
hdu-1596-find the safest road(dijkstra)
hdu-1596-find the safest road(dijkstra)
68 0
Codeforces Round #192 (Div. 2) (330B) B.Road Construction
要将N个城市全部相连,刚开始以为是最小生成树的问题,其实就是一道简单的题目。 要求两个城市之间不超过两条道路,那么所有的城市应该是连在一个点上的,至于这个点就很好找了,只要找到一个没有和其他点有道路限制的即可。
64 0
codeforces 347A - Difference Row
给你一个序列,让你求(x1 - x2) + (x2 - x3) + ... + (xn - 1 - xn).值最大的一个序列,我们化简一下公式就会发现(x1 - x2) + (x2 - x3) + ... + (xn - 1 - xn). = x1 - xn, 也就是说只有第一个和最后一个是确定的,其他的随便了! 也不是了, 还要让你按字典序最小的排列,也就是说其他的是按飞递减序排列的,简单的一次排序就OK了。
38 0
The Preliminary Contest for ICPC China Nanchang National Invitational J题 Distance on the tree
The Preliminary Contest for ICPC China Nanchang National Invitational J题 Distance on the tree
106 0
《The Six Sense of Auto-driving Car —— Road to Autonomous Driving》电子版地址
The Six Sense of Auto-driving Car —— Road to Autonomous Driving
82 0
《The Six Sense of Auto-driving Car —— Road to Autonomous Driving》电子版地址
ICPC Latin American Regional 2017-Imperial roads(LCA)
题目大意: 给出n个点,m条边的一个图,q个询问, 每次询问给出两个点u,v,问包含u-v这条边的最小生成树是多少 这道题比较板 首先求一下这个图的最小生成树对于这n个点,最小生成树一定是n-1条边,如果说再加上一条边,一定会构成一个环。 我们把生成的这个最小生成树看作是一个以1为根节点的最小生成树。 所以说在下面的q个询问中,如果说这条边用到了最小生成树中(这条边是最小生成树上的边),那么直接输出当前最小生成树的代价就好;如果说当前这条边没有出现在最小生成树当中,那么最小生成树的权值val加上这条边之后就构成了一个环,求出这两个点所在的环内的最大边权,并将这个边权减去,就是最终结果
132 0
ICPC Latin American Regional 2017-Imperial roads(LCA)
Google Earth Engine ——LANDSAT/LT04/C01/T1_32DAY_/8day/annual_BAI
Google Earth Engine ——LANDSAT/LT04/C01/T1_32DAY_/8day/annual_BAI
121 0
Google Earth Engine ——LANDSAT/LT04/C01/T1_32DAY_/8day/annual_BAI
HDU-1598,find the most comfortable road(并查集+枚举)
HDU-1598,find the most comfortable road(并查集+枚举)
【1087】All Roads Lead to Rome (30 分)
【1087】All Roads Lead to Rome (30 分) 【1087】All Roads Lead to Rome (30 分)
132 0