11 2018 档案

离散化
摘要：（说明后补） cin >> n; for (int i = 1;i <= n; ++i) { cin >> B[i]; C[i] = B[i]; } sort(C+1,C+n+1); int m = unique(C+1,C+n+1) - C-1; for (int i = 1;i <= n; ++ 阅读全文
posted @ 2018-11-28 03:32 Frank的成长之路 阅读(154) 评论(0) 推荐(0)