Longest Ordered Subsequence Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 45282 Accepted: 20075 Description A numeric sequence of ai is ordered if a1 < a2 < … < aN. Let the subsequenc

//题意：求最长上升子序列 //思路：记录每个状态的最大值，且时刻维护最大值 #include <iostream>#include <algorithm>#include <cstdio>#include <cstring>using namespace std;int num[1000+10];int dp[1000+10];int main(){int n;while(scan