摘要：图的存储有4种形式：邻接矩阵，前向星，邻接表，链式前向星（属于邻接表） 1.链接矩阵 这个是我们最常用的，开一个map[i][j] 初始化 map[i][i]=0,map[i][j]=inf; 初始化需要o（n*n）,建图 m 缺点 ：遍历效率较低，并且不能存储重边， 初始化效率低；图的空间开销大。 阅读全文

摘要：A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24 阅读全文

摘要：JGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two parallel lines. Half of these cities are rich in r 阅读全文

摘要：Max Sum Plus Plus Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 30478 Accepted Submission(s): 1 阅读全文

摘要：免费馅饼 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 51189 Accepted Submission(s): 17854 Problem 阅读全文

摘要：1.HDU 1003 求最长连续相加的和。 dp[i]=max(a[i],dp[i-1]+a[i]); dp[i]表示以 i 结尾的最大值。 再开/个strat去标记从哪里开始。 2.hdu 1087 求最长上升序列的和； dp[i]=max(dp[j])+a[i]; a[j]<a[i]; 3.HD 阅读全文