oj.uz

Submission #581688

# Submission time Handle Problem Language Result Execution time Memory
581688 2022-06-23T03:53:16 Z XJP12 Cloud Computing (CEOI18_clo) C++14
0 / 100
 1 ms 300 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
vi a;
int lis(int n) {
    int INF = INT_MAX;
    vector<int> d(n+1, INF);
    d[0] = -INF;

    for (int i = 0; i < n; i++) {
        int j = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
        if (d[j-1] < a[i] && a[i] < d[j]) d[j] = a[i];
    }

    int ans = 0;
    for (int i = 0; i <= n; i++) {
        if (d[i] < INT_MAX)
            ans = i;
    }
    return ans;
}
int main(){
    int n;
    cin>>n;
    a.resize(n,0);
    for(int i=0; i<n; i++){
        cin>>a[i];
    }
    cout<<lis(n)<<endl;

 return 0;
}

Subtask #1
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 296 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -