POJ-2533-Longest Ordered Subsequence(LIS模板)
摘要:
Description A numeric sequence of ai is ordered if a1 #include #include using namespace std;int main(){ int n,i,j,a[1005],d[1005]; while(scanf("... 阅读全文
posted @ 2015-07-16 17:00 甜蜜蜜吖甜蜜蜜 阅读(147) 评论(0) 推荐(0)
浙公网安备 33010602011771号