Too much thinking! Too much annoying.

I am now in great demand for an opportunity to yearn for, the ability to express myself, in a maximum scale to let other people know about me, and my feeling as well.

First: a good atmosphere could affect someone in a good way, and otherwise may be counterproductive. I am now temporarily living in one single room with my cousin, whose apartment is very near from my own worksite. He is a super-straight man, thinking everything evil and disgusting which has (even little) connection with the stuff like homosexuality. And therefore he get himself quite a different from as I live. I used to be very diligent in daily chores and he said he could remember that; and now I become a lazy and common person due to my present living habit and unhealthy mindset. While, the truth is he is in my mind, a very lazy person, as exactly as what he describes me. He has a single apartment which might size 25 square meters, with elaborated design and practical decoration (like chairs and balcony-sofa). The problem is he doesn’t often take good care of his room, like sweeping the floor, and collecting the dust. He also cook in this room. As a consequence a lot of flavors mixed with different origins stimulate your nose and mind. His solution to this was just nothing at all. He has blamed me for not helping him cleaning the floor and making the bed. Well the truth in China is: when you’re living under someone’s house, you have to take the owner’s orders into account. However, I forsake it. Most possibly reason is: I ignore this because he is my cousin, and as a relative who also comes from my father’s family part, I disrespected him unconsciously. He had done very sin-like stuff to me when I was very young and was having a resident identity in his family and house. He could do those unspeakable insulting things to me, well which after so many years I found affected me so much and haunts me so heavily. I suddenly stand at someone else’s point and judge on me, the conclusion is: I am of a pity, and devastation could be percept even not as tiny as a single drop of dust in air. My experiences could just be mine, but more of us in this world are sharing the same circumstances. (This world is twisted by those unseen and unknown forces, that we could not ever find or change, which is of a very sad story.)

Second: consumption is more than my income. I have been in an internship in an f-c, which doesn’t earn me much but can afford my controllable purchases. Once I claim for more it will become very disappointing and melancholy. One cannot cover his expenses, and then he or she is going to suffer from a certain series torment. I met Han Han a few days ago, and having had a night spent in embraces and kisses and oral sexes, I thought he could be the one (the one I admire for his courage, capability, talent, wealth and quality). Well then what I figure in my mind is to compare myself to him, to lift myself to the level as he in, as much as possible. Then I went to Xinhua Hospital, to claim for an operation on my penis, ‘cuz I had the covering skin too much and somehow affected my normal life in the past almost 8 years. I had mentioned this to my father a year ago, and what he said made me more timid and scare to tell other people the truth about my sexual organ. Also, I bought a brand new jacket online which cost a lot more than my average consumption amount. A playboy branded jacket costed 270 yuan, and a Tebu branded jacket costed me 260, and I guess I never have expended so much on my dressing. Now for what I do? In my opinion, for the lift-up to another level of living standard, and appearance standard.

Third: I have to say: I am now in danger. I have no idea how I perform in the f-c. So I don’t know if I could be excelling in things I need to master. Sometimes I just worry too much, but though they don’t make no sense.

时间: 2024-12-12 14:15:19

Too much thinking! Too much annoying.的相关文章

HDOJ 5296 Annoying problem LCA+数据结构

dfs一遍得到每一个节点的dfs序,对于要插入的节点x分两种情况考虑: 1,假设x能够在集合中的某些点之间,找到左边和右边距离x近期的两个点,即DFS序小于x的DFS序最大点,和大于x的DFS序最小的点...... 2.假设x在集合中的点某一側,则找距离x的dfs序最小和最大的点 将x插入这个集合最少要走的距离为 dist[x]-dist[LCA(left,x)]-dist[LCA(right,x)]+dist[LCA(left,right)] 删除同理 Annoying problem Tim

HDU 5296 Annoying problem LCA+树状数组

题解链接 Annoying problem Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 480    Accepted Submission(s): 146 Problem Description Coco has a tree, whose nodes are conveniently labeled by 1,2,-,n, w

hdu5296(2015多校1)--Annoying problem(lca+一个公式)

Annoying problem Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 483    Accepted Submission(s): 148 Problem Description Coco has a tree, whose nodes are conveniently labeled by 1,2,-,n, which

HDU 5296 Annoying problem(LCA模板+树的dfs序心得)

Problem Description Coco has a tree, whose nodes are conveniently labeled by 1,2,-,n, which has n-1 edge,each edge has a weight. An existing set S is initially empty. Now there are two kinds of operation: 1 x: If the node x is not in the set S, add n

sdut oj 2372 Annoying painting tool (【暴力枚举测试】1Y )

Annoying painting tool 题目描述 Maybe you wonder what an annoying painting tool is? First of all, the painting tool we speak of supports only black and white. Therefore, a picture consists of a rectangular area of pixels, which are either black or white.

poj3363 Annoying painting tool

Annoying painting tool Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1736   Accepted: 1165 Description Maybe you wonder what an annoying painting tool is? First of all, the painting tool we speak of supports only black and white. There

HDU 5296 Annoying Problem 树链剖分 LCA 倍增法

HDU 5296 Annoying Problem 题目链接:hdu 5296 题意:在一棵给定的具有边权的树,一个节点的集合S(初始为空),给定Q个操作,每个操作增加或删除S中的一个点,每个操作之后输出使集合S中所有点联通的最小子树的边权和. 思路:最小子树上的节点的充要条件: 节点为(S集合中所有点的LCA)的子节点: 节点有一个子孙为S集合中的点. 那么我们给每个节点都开一个标记数组,初始为零,每加入一个节点,就把从这个节点到根节点路径上的点的值都+1,反之-1,这样通过对每个单节点值的查

14 POJ3363 Annoying painting tool

给一个全0矩阵,每次你可以使得一个r*c的子矩阵01翻转,问是否可以通过这种操作使得矩阵变为题目给定的矩阵,最少需要多少次操作. 可以发现,对于第一行第一个点,它只能通过翻转包含(1,1)这个点在内的矩阵才能变,也就是r*c的左上端点在(1,1). 通过至多一次操作,我们可以保证这个点可以达到目标状态. 接着第二个点,我们首先不能影响第一个点,因此如果这个点与目标状态不同,我们只能以这个点为翻转矩阵的左上角,来翻转. 同样,通过至多一次操作第二个点也可以到达目标状态. 因此,我们从上到下,从左到

[2015hdu多校联赛补题]hdu5296 Annoying problem

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5296 题意:给你一棵n个结点的边权树和一个树上点的集合,开始时集合为空 然后进行两种操作: 1.如果结点u不在集合中,那么将u加入集合 2.如果结点u在集合中,那么删除u 每次操作后输出包含点集合的最小联通子图的边权和 题解: 其实问题的本质就是求结点u与子图的距离(如果在子图内部距离为0),yy一下可以想到,若x.y为集合中与u最近的两点,那么dis(u,子图)=dis(u,联通u.x.y三点的汇

HDU5296 Annoying problem(LCA)

1 //#pragma comment(linker, "/STACK:1677721600") 2 #include <map> 3 #include <set> 4 #include <stack> 5 #include <queue> 6 #include <cmath> 7 #include <ctime> 8 #include <vector> 9 #include <cstdio>