제출 #322350

#제출 시각아이디문제언어결과실행 시간메모리
322350Karen124Global Warming (CEOI18_glo)C++14
0 / 100
104 ms3060 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long int #define F first #define S second #define pb push_back const ll N = 2e5 + 10; const ll LOG = 50; const ll MOD = 1e9 + 7; const ll INF = 1e9 + 10; int n, X, a[N], b[N], dp[2][N], ans; int LIS(){ int len = 0, p = 0; for (int i = 1; i <= n; i++){ p = upper_bound(b, b + len, a[i]) - b; b[p] = a[i]; len = max(len, p + 1); } cout << len << '\n'; exit(0); } int main() { cin >> n >> X; for (int i = 1; i <= n; i++){ cin >> a[i]; } if (X == 0) {LIS();} else {return 0;} for (int i = 1; i <= n; i++){ ans = max({ans, dp[0][i], dp[1][i]}); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...