#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
#define rnd(l, r) uniform_int_distribution<int>(l, r)(rng)
using namespace std;
void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
int pow(int a,int b,int m){int ans=1;while(b){if(b&1){ans=(ans*a)%m;}b>>=1;a=(a*a)%m;}return ans;}
int binpow(int a,int b){int ans=1;while(b){if(b&1){ans=(ans*a);}b>>=1;a=(a*a);}return ans;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int inf = 1e9, N = 2e5 + 100;
struct node{
int mn;
node *l, *r;
node(){
mn = 0;
l = nullptr;
r = nullptr;
}
};
void update(node *&p, int pos, int val, int tl = 0, int tr = inf){
if(p == nullptr){
p = new node();
}
if(tl == tr){
p -> mn = val;
return;
}
int mid = (tl + tr) >> 1;
if(pos > mid)
update(p -> r, pos, val, mid + 1, tr);
else
update(p -> l, pos, val, tl, mid);
int left = 0;
if(p -> l != nullptr)
left = p -> l -> mn;
int right = 0;
if(p -> r != nullptr)
right = p -> r -> mn;
p -> mn = max(left, right);
}
int get(node *p, int l, int r, int tl = 0, int tr = inf){
if(p == nullptr)return 0;
if(tl > r || tr < l)
return 0;
if(tl >= l && tr <= r)
return p -> mn;
int mid = (tl + tr) >> 1;
return max(get(p -> r, l, r, mid + 1, tr), get(p -> l, l, r, tl, mid));
}
int a[N];
main(){
iostream::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n, d;
cin >> n >> d;
node *root = new node();
int ans = 0;
for(int i = 1 ; i<= n; i++){
cin >> a[i];
int g = get(root, 0, a[i] - 1);
ans = max(g + 1, ans);
int x = get(root, a[i], a[i]);
if(x < g + 1)
update(root, a[i], g + 1);
}
cout << ans << endl;
//for
}
/*
* Before implementing the problem:
Do I understand the problem correctly?
Which places are tricky? What do I need to remember to implement them correctly?
Which place is the heaviest by implementation? Can I do it simpler?
Which place is the slowest? Where do I need to be careful about constant factors and where I can choose slower but simpler implementation?
----------------------------------
If not AC:
Did you remember to do everything to handle the tricky places you thought about before?
Is the solution correct?
Do I understand the problem correctly?
----------------------------------
If you have a test on which the solution gives wrong answer:
Is the solution doing what it was supposed to do?
Is the problem in the code or in the idea?
*/
Compilation message
glo.cpp:61:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
61 | main(){
| ^~~~
glo.cpp: In function 'void fp(std::string)':
glo.cpp:13:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
glo.cpp:13:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
13 | void fp(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
296 ms |
87088 KB |
Output is correct |
| 2 |
Correct |
272 ms |
87032 KB |
Output is correct |
| 3 |
Correct |
261 ms |
87120 KB |
Output is correct |
| 4 |
Correct |
270 ms |
87092 KB |
Output is correct |
| 5 |
Correct |
133 ms |
47856 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
25412 KB |
Output is correct |
| 2 |
Correct |
59 ms |
25176 KB |
Output is correct |
| 3 |
Correct |
63 ms |
25380 KB |
Output is correct |
| 4 |
Incorrect |
35 ms |
13908 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
123 ms |
46932 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
