sogaoAccepted sogaoAccepted
关注数: 0 粉丝数: 2 发帖数: 524 关注贴吧数: 1
≮坏蛋吧≯ 秋天的等待 秋天的等待孤单的歌，孤寂的城，孤独的路灯。阴郁的云，阴冷的雨，阴沉的夜空。草枯了，叶落了，秋天已变冷。漂泊的人，寂寞的人，悄悄地等。等，等到鱼儿哭干了泪水，等，等到雁儿忘记了归程，等，等到时间收起了脚步，等，等到岁月里，不再有忧郁的歌声。昏惑的心，昏沉的梦，昏暗的灯。凄迷的云，凄苦的雨，凄凉的风。夜深了，人散了，是谁还在等？秋天的树，秋天的人，秋天已变冷。有时候，我也想，变成石头。不用去看，不用去哭，不用去心痛。雨停了，夜尽了，是谁还在等？梦里的梦，梦里的人，梦不会变冷。
早上起来被鬼吓了。。晕死 我胆子小，家就我一人，所以晚上睡觉总是开着灯睡结果今天早上起来，灯是灭的。。当时就晕了，以为被盗了。。结果一看家里啥都没丢，门锁的死牢。。完了，估计被不干净东西光顾了。。害怕的要死不过相比之下还是迟到后的老师比较可怕，于是我去上学了一天下来事也忘了。刚回到家顺手开灯，没反应，突然想起早上的事吓得半死。。随即一愣，又按了几下开关。。。晕 肯定是灯丝烧了
删我贴的帅哥 给个理由先 删我贴的帅哥 给个理由先
郁闷。。从学校出门崴着脚。。 这脚肿的跟猪蹄一样。。晕了。。
≮坏蛋吧≯【求助】谁英语好给咱翻译个题目 DescriptionFarmer John wants to set up a telephone line at his farm. Unfortunately, the phone company is uncooperative, so he needs to pay for some of the cables required to connect his farm to the phone system.There are N (1 ≤ N ≤ 1,000) forlorn telephone poles conveniently numbered 1..N that are scattered around Farmer John's property; no cables connect any them. A total of P (1 ≤ P ≤ 10,000) pairs of poles can be connected by a cable; the rest are too far apart.The i-th cable can connect the two distinct poles Ai and Bi, with length Li (1 ≤ Li ≤ 1,000,000) units if used. The input data set never names any {Ai, Bi} pair more than once. Pole 1 is already connected to the phone system, and pole N is at the farm. Poles 1 and N need to be connected by a path of cables; the rest of the poles might be used or might not be used.As it turns out, the phone company is willing to provide Farmer John with K (0 ≤ K < N) lengths of cable for free. Beyond that he will have to pay a price equal to the length of the longest remaining cable he requires (each pair of poles is connected with a separate cable), or 0 if he does not need any additional cables.Determine the minimum amount that Farmer John must pay.Input* Line 1: Three space-separated integers: N, P, and K* Lines 2..P+1: Line i+1 contains the three space-separated integers: Ai, Bi, and Li Output* Line 1: A single integer, the minimum amount Farmer John can pay. If it is impossible to connect the farm to the phone company, print -1.Sample Input5 7 11 2 53 1 42 4 83 2 35 2 93 4 74 5 6Sample Output4
≮坏蛋吧≯【求助】谁英语好给咱翻译个东西 谢谢.. DescriptionBessie has moved to a small farm and sometimes enjoys returning to visit one of her best friends. She does not want to get to her old home too quickly, because she likes the scenery along the way. She has decided to take the second-shortest rather than the shortest path. She knows there must be some second-shortest path.The countryside consists of R (1 ≤ R ≤ 100,000) bidirectional roads, each linking two of the N (1 ≤ N ≤ 5000) intersections, conveniently numbered 1..N. Bessie starts at intersection 1, and her friend (the destination) is at intersection N.The second-shortest path may share roads with any of the shortest paths, and it may backtrack i.e., use the same road or intersection more than once. The second-shortest path is the shortest path whose length is longer than the shortest path(s) (i.e., if two or more shortest paths exist, the second-shortest path is the one whose length is longer than those but no longer than any other path).InputLine 1: Two space-separated integers: N and R Lines 2..R+1: Each line contains three space-separated integers: A, B, and D that describe a road that connects intersections A and B and has length D (1 ≤ D ≤ 5000)OutputLine 1: The length of the second shortest path between node 1 and node NSample Input4 41 2 1002 4 2002 3 2503 4 100Sample Output450HintTwo routes: 1 -> 2 -> 4 (length 100+200=300) and 1 -> 2 -> 3 -> 4 (length 100+250+100=450)
走了。。以后好好学习了。。 同志们再见。。
我正上课呢,无聊,有人来聊天设 谢谢啊
看了N多贴，发现好多都是河南老乡，可兴奋 我新乡了
决定不做IP党了。。。怎么才能加入会员捏？ 一直都在 坏蛋是怎样炼成的 吧里潜水 从初中看到高中上个月才发现原来还有个 坏蛋吧 我晕啊 不过以后就方便了 上贴吧再也不用打那么多字了 俩就够了 哈哈哈哈终于弄了个马甲，以后我也是有衣服穿得了人了
1 下一页