# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
999172 | vjudge1 | LIS (INOI20_lis) | C++17 | 4051 ms | 980 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
void solve(){
int n,x,y;
cin >> n;
vector<int> c;
for(int i=0;i<n;i++){
cin >> x >> y;
c.insert(c.begin()+x-1,y);
vector<int> dp;
for(auto x:c){
int h=lower_bound(dp.begin(),dp.end(),x)-dp.begin();
if(h==dp.size()){
dp.push_back(x);
}
else{
dp[h]=x;
}
}
cout << dp.size() << "\n";
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int t=1;
while(t--){
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |