the apple tree
the apple tree
A little boy loved to come and lay around it every day. He climbed to the tree top, ate
-the apples, took a nap under the shadow... He loved the tree and the tree loved to play with
him. Time went by... the little boy had grown up and he no longer played around the tree every
day. One day, the boy came back to the tree and he looked sad. "Come and play with me," the
tree asked the boy. "I am no longer a kid, I don't play around trees anymore." The boy
replied, "I want toys. I need money to buy them." "Sorry, but I don't have money...but you
can pick all my apples and sell them. So, you will have money." The boy was so excited.
He grabbed all the apples on the tree and left happily. The boy never came back after he
picked the apples.The tree was sad.One day, the boy returned and the tree was so excited.
"Come and play with me," the tree said. "I don't have time to play. I have to work for
my family. We need a house for shelter. Can you help me?" "Sorry, but I don't have a
house. But you can chop off my branches to build your house." So the boy cut all the branches
off the tree and left happily. The tree was glad to see him happy but the boy never came
back since then. The tree was again lonely and sad.One hot summer day, the boy returned
and the tree was delighted. "Come and play with me!" the tree said. "I am sad and
getting old. I want to go sailing to relax myself. Can you give me a boat?
" "Use my
trunk to build your boat. You can sail far away and be happy." So the boy cut the
tree trunk to make a boat. He went sailing and never showed up for a long time. The tree was
happy, but it was not true.Finally, the boy returned after he left for so many years. "Sorry,
my boy. But I don’t have anything for you anymore. No more apples for you..." the tree said.
"I don’t have teeth to bite," the boy replied. "No more trunk for you to climb on."
"I am too old for that now," the boy said. "I really can't give you anything... the only
thing left is my dying roots,” the tree said with tears.“I don’t need much now, just a place
to rest. I am tired after all these years.” The boy replied. “Good! Old tree roots is the best
place to lean on and rest. Come, Come sit down with me and rest.” The boy sat down and the tree
was glad and smiled with tears...This is a story of everyone. The tree is our parent. When we
were young, we loved to play with Mom and Dad... When we grown up, we left them, and only came
to them when we need something or when we are in trouble. No matter what, parents will always be
there and give everything they could to make you happy. You may think that the boy is cruel to
the tree but that’s how all of us are treating our parents.
the apple tree的更多相关文章
- POJ 2486 Apple Tree
好抽象的树形DP......... Apple Tree Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6411 Accepte ...
- poj 3321:Apple Tree(树状数组,提高题)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18623 Accepted: 5629 Descr ...
- poj 3321 Apple Tree dfs序+线段树
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Description There is an apple tree outsid ...
- [poj3321]Apple Tree(dfs序+树状数组)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 26762 Accepted: 7947 Descr ...
- POJ 3321 Apple Tree(树状数组)
Apple Tree Time Limit: 2000MS Memory Lim ...
- 【HDU 4925】BUPT 2015 newbie practice #2 div2-C-HDU 4925 Apple Tree
http://acm.hust.edu.cn/vjudge/contest/view.action?cid=102419#problem/C Description I’ve bought an or ...
- POJ 3321 Apple Tree(DFS序+线段树单点修改区间查询)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 25904 Accepted: 7682 Descr ...
- URAL 1018 Binary Apple Tree(树DP)
Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a bina ...
- POJ3321 Apple Tree (树状数组)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16180 Accepted: 4836 Descr ...
- Apple Tree(需要预处理的树状数组)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20335 Accepted: 6182 Descr ...
随机推荐
- 30第二建筑Github Page
从我原来博客的前端传输.链接:http://www.hacke2.cn/create-github-page/ 假设中国每一个程序猿都写博客,那么中国IT届的春天就来了 有同学问我的站点是怎么创建的, ...
- java解析String类型t复杂xml,多级节点,最好的例子
需要用jar包 dom4j-1.6.1.jar 字符串xml如下: <root> <flw> <name>aa</name> <age>22 ...
- String的Split方法的用法与要注意事项
转自:http://shukuiyan.iteye.com/blog/1058672 之前在http://shukuiyan.iteye.com/blog/507915文中已经叙述过这个问题,但是最近 ...
- notepad扩展搜索,正则搜索
Dos和windows采用回车+换行CR/LF表示下一行, 0d 0a 两个字节表示而UNIX/Linux采用’\n’换行符LF表示下一行(ASCII代码是10),0a一个字节表示MAC OS系统则采 ...
- Codeforces Jzzhu and Sequences(圆形截面)
# include <stdio.h> int f[10]; int main() { int x,y,n,j; while(~scanf("%d%d%d",& ...
- 对consistencygroup的一些研究和实践
声明: 本博客欢迎转载,但请保留原作者信息! 作者:李人可 团队:华为杭州OpenStack团队 consistency group,直译是一致性组,是Juno版本号cinder新引进的一个概念.顾名 ...
- VS2008--无法找到“XXX.exe”的调试信息,或者调试信息不匹配
------解决方案----- 1. 关闭掉Visual Studio 实例. 2. 找到解决方案下的.suo文件并删除之. 3. 重新启动Visual Studio,或者直接双击.sln文件打开 4 ...
- Smarty中模板eq相等 ne、neq不相等, gt大于, lt小于
eq相等 ne.neq不相等, gt大于, lt小于 gte.ge大于等于 lte.le 小于等于 not非 mod求模 is [not] div by是否能被某数整除 i ...
- CSS选项卡
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" " http://www.w3.org ...
- zoj3822 期望dp
每天在一个n*m的棋盘上放棋子,问使得每一行,每一列都有棋子的期望天数 dp[n][m][k] 表示用k个棋子占据了n行,m列,距离目标状态还需要的期望天数 那么dp[n][m][k] = p1 * ...