勇敢的心~

摘要： Buildings Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1622 Accepted Submission(s): 460 Prob 阅读全文

摘要： SouvenirAccepts: 901Submissions: 2743Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Problem DescriptionToday is the ... 阅读全文

摘要： 第一题想当然了，结果被坑。。 有1的肯定能构成所有的其他数，没有1的肯定构不成1 ，这题T T #include <iostream> #include <cstring> #include <cstdio> #include <algorithm> using namespace std; int 阅读全文

摘要： uva12545 Bits Equalizer You are given two non-empty strings S and T of equal lengths. S contains the characters `0', `1' and `?', whereas T contains ` 阅读全文

摘要： uva12546. LCM Pair Sum One of your friends desperately needs your help. He is working with a secret agency and doing some encoding stuffs. As the miss 阅读全文

摘要： Problem Description OO has got a array A of size n ,defined a function f(l,r) represent the number of i (l<=i<=r) , that there's no j(l<=j<=r,j<>i) sa 阅读全文

摘要： 就是按着DP的思路来做的，结果还是想不到。T_T，行了，别玻璃心了，继续。这道题目是求在一列数里，由两部分子段和组成的最大和。即对于连续整数组成的串 S1、S2，使 S1 + S2 的和最大。题目与求最大子段和有相似之处，可以说是最大子段和的变形。最大子段和： 在一列数里，对于连续整数组成的串S，... 阅读全文

摘要： 算法想到了，题目坑太多，数组，含‘0’ #include <cstdio> #include <algorithm> #include <cstring> #include <iostream> #define LL long long const int MAXN = 50100; using n 阅读全文

摘要： A. Combination Locktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputScrooge McDuck keeps his most... 阅读全文

摘要： A. Mike and Faxtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Mike was walking in the subw... 阅读全文

摘要： public class Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode ret = new ListNode(0); ListNode cur = ret; ... 阅读全文

摘要： You are given a string q. A sequence of k strings s1, s2, ..., sk is called beautiful, if the concatenation of these strings is string q (formally, s1 阅读全文

摘要： DescriptionA group of cows grabbed a truck and ventured on an expedition deep into the jungle. Being rather poor drivers, the cows unfortunately manag... 阅读全文

摘要： Description一年一度的哈理工选美大赛开始了.来自各个院系的N个美女们都在一起排成一排，然后从左到右给他们标号(1-N),评委叫兽开始观摩,由于身高高低都不同, 叫兽想从中选出尽可能多的人使得他们的身高从左到右依次递增，你能帮助叫兽吗？Input 输入数据第一行一个数据表示美女的个数N(0... 阅读全文

摘要： 列车调度(Train)DescriptionFigure 1 shows the structure of a station for train dispatching.Figure 1In this station, A is the entrance for each train and B ... 阅读全文

摘要： 灯塔(LightHouse)DescriptionAs shown in the following figure, If another lighthouse is in gray area, they can beacon each other.For example, in following... 阅读全文

摘要： DescriptioinLet S be a set of n integral points on the x-axis. For each given interval [a, b], you are asked to count the points lying inside.InputThe... 阅读全文

摘要： B. Han Solo and Lazer Guntime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n Imperial sto... 阅读全文

摘要： C. Drazil and Factorialtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDrazil is playing a math ... 阅读全文

摘要： A. Drazil and Datetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSomeday, Drazil wanted to go on... 阅读全文