博学善思

摘要： 在郊区有 N 座通信基站，P 条双向电缆，第 i 条电缆连接基站AiAi和BiBi。 特别地，1 号基站是通信公司的总站，N 号基站位于一座农场中。 现在，农场主希望对通信线路进行升级，其中升级第 i 条电缆需要花费LiLi。 电话公司正在举行优惠活动。 农产主可以指定一条从 1 号基站到 N 号基 阅读全文

摘要： 给定长度为N的数列A，以及M条指令，每条指令可能是以下两种之一： 1、“1 x y”，查询区间 [x,y] 中的最大连续子段和，即 maxx≤l≤r≤ymaxx≤l≤r≤y{∑ri=lA[i]∑i=lrA[i]}。 2、“2 x y”，把 A[x] 改成 y。 对于每个查询指令，输出一个整数表示答案 阅读全文

摘要： 链接：https://ac.nowcoder.com/acm/contest/16/A来源：牛客网 题目描述 FST是一名可怜的小朋友，他很强，但是经常fst，所以rating一直低迷。 但是重点在于，他非常适合ACM！并在最近的区域赛中获得了不错的成绩。 拿到奖金后FST决定买一台新笔记本，但是F 阅读全文

摘要： 思路及代码参考：https://blog.csdn.net/u014800748/article/details/45420085 There is an infinite sequence consisting of all positive integers in the increasing 阅读全文

摘要： Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Ma 阅读全文

摘要： Description You are working for Macrohard company in data structures department. After failing your previous task about key insertion you were asked t 阅读全文

摘要： Problem Description String matching is a common type of problem in computer science. One string matching problem is as following:Given a string s[0…le 阅读全文

摘要： Mario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Ma 阅读全文

摘要： In this problem, you have to analyze a particular sorting algorithm. The algorithm processes a sequence of n distinct integers by swapping two adjacen 阅读全文

摘要： Bessie 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 阅读全文