摘要： 题目来源：http://http://acm.nyist.net/JudgeOnline/problem.php?pid=17单调递增最长子序列#include<iostream> #include<cstdio> #include<cstring> using namespace std; int d[10005]; int main() { int N; scanf("%d",&N); int i,j,Max; char str[10005]; while(N--) { scanf("%s",str); i 阅读全文