超越自我就是成功

I NEED A OFFER! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24731    Accepted Submission(s): 9988 Problem Description Speakless

    题目链接:点击打开链接    正向求最长上升子序列并且将记录，反向求最长上升子序列并且维护答案。    #include<bits/stdc++.h> using namespace std; #define rep(i,j,k) for(int i=j;i<=k;i++) typedef long long ll; int dp1[500005]; int dp2[5...

题目传送门:    点击打开链接    第15届浙江省程序设计竞赛 (算是一个金牌界线题，不算很难，赛场上没怎么研究这道题，赛后晚上再被窝里一想，卧槽简单题)    这题先根据大小关系建图，然后用拓扑排序维护一下O(n）的效率，如何建图？    假设当前序列的第i个数值是2，则他一定比前面最小的那为1(第q个)的来的大，比前面最小的那个2(第k个)来的小，那么拿i向q连边，k向i连边，最多2*n条...

1007. Maximum Subsequence Sum (25) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue Given a sequence of K integers { N

悼念512汶川大地震遇难同胞——珍惜现在，感恩生活 Time Limit : 1000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 59   Accepted Submission(s) : 34 Font: Times New Roman | Verda

Coins Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12519    Accepted Submission(s): 5023 Problem Description Whuacmers use coins.The

Big Event in HDU Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 62   Accepted Submission(s) : 26 Font: Times New Roman | Verdana | Georgia

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4852    Accepted Submission(s): 1844 Problem Description The aspiring Roy t

Square Coins Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 27   Accepted Submission(s) : 16 Font: Times New Roman | Verdana | Georgia

寒冰王座 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15140    Accepted Submission(s): 7799 Problem Description 不死族的巫妖王发工资拉,死亡骑士拿到一张

FATE Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 23   Accepted Submission(s) : 17 Font: Times New Roman | Verdana | Georgia Font

饭卡 Time Limit : 5000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 51   Accepted Submission(s) : 25 Font: Times New Roman | Verdana | Georgia Font Si

题目链接： 点击打开链接树形的dp搞一搞dp[i][0]表示前i个还没出现1的最大值dp[i][1]表示前i个已经出现1的最大值这题数据范围100....emmmm让我觉得n^2的最长上升子序列不是就可以么...#include<bits/stdc++.h> using namespace std; #define rep(i,j,k) for(int i=j;i<=k;i++...