| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1171697 | DanerZein | Financial Report (JOI21_financial) | C++20 | 34 ms | 4936 KiB |
#include "bits/stdc++.h"
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
long long n, d, r = 0;
cin>>n>>d;
vector<long long> a(n);
for(long long i = 0; i < n; i++) cin>>a[i];
vector<long long> zd(n + 2, 2222222222222222);
zd[0] = -zd[0];
for(long long i = 0; i < n; i++){
long long j = upper_bound(zd.begin(), zd.end(), a[i]) - zd.begin();
r = max(r, j);
zd[j] = min(zd[j], a[i]);
}
cout<<r;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
