Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
97340 iui2006 导弹拦截问题 C++ Wrong Answer 1 MS 292 KB 859 2024-11-14 00:32:27

Tests(0/10):


Code:

#define _CRT_SECURE_NO_WARNINGS #include <math.h> #include <vector> #include <algorithm> #include <iostream> using namespace std; int hs[100001] = { }; int fn[100001] = { 50001 }; int fm[100001] = {}; int main() { int len = 0; while (scanf("%d", &hs[len++]) != EOF) if (getchar() == '\n') break; int maxm = 0; fm[0] = hs[--len]; for (int i = len; i >= 0; i--){ int j = 0; for (; j < maxm; j++) { if (hs[i] <= fm[j]) { fm[j] = hs[i]; break; } } if (j == maxm)fm[maxm++] = hs[i]; } int maxn = 0; fn[0] = hs[0]; for (int i = 0; i < len; i++){ int j = 0; for (; j < maxn; j++){ if (hs[i] <= fn[j]) { fn[j] = hs[i]; break; } } if (maxn == j)fn[maxn++] = hs[i]; } printf("%d\n%d\n", maxm, maxn); return 0; }


Run Info:

------Input------
123 256 369 213 456 956 23 698 1236 321 500 666
------Answer-----
6
------Your output-----
3 6