# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1059813 |
2024-08-15T08:25:34 Z |
vjudge1 |
LIS (INOI20_lis) |
C++17 |
|
0 ms |
348 KB |
#include <bits/stdc++.h>
#ifdef LOCAL
#include "/home/trcmai/code/tools.h"
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define debug(x...)
#endif
using namespace std;
#define all(a) a.begin(), a.end()
#define ll long long
#define endl '\n'
const int N = 1e6 + 6, LOG = 27, MOD = 1e9 + 7;
const ll INF = 1e18;
int n,q;
signed main() {
cin.tie(0)->sync_with_stdio(0);
auto solver=[&](){
cin>>q;
vector<int>a;
while(q--){
int pos,val; cin>>pos>>val;
a.insert(a.begin() + pos - 1,val);
multiset<int>st;
for(int i = 0;i < n;++i){
st.insert(a[i]);
auto it = st.lower_bound(a[i]);
if(it != st.end()) st.erase(it);
}
cout<<st.size()<<endl;
}
};
int t = 1; // cin>>t;
while (t--) solver();
}
# |
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 |
- |