Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- int lis(int A[], int n){
- int lis[n];
- lis[0] = 1;
- for (int i=0; i<n; i++){
- lis[i] = 1;
- for (int j = 0; j < i; j++ ){
- if ( A[i] > A[j] && lis[i] < lis[j] + 1)
- lis[i] = lis[j] + 1;
- }
- }
- cout << *max_element(lis, lis+n) << "\n";
- }
- int main(){
- int T;
- while(T--){
- int N; cin >> N;
- int A[N];
- for (int i=0; i<N; i++){
- cin >> A[i];
- }
- int n = sizeof(A)/sizeof(A[0]);
- lis(A,n);
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment