Dynamic programming

Longest subsequence of array of integers

#include <iostream>
#include <vector>
using namespace std;

int calc(int temp, vector<int> &input, vector<int> &L, vector<vector<int>> &mem){
    if(L.size()==0){
        L.push_back(1);
        mem.push_back(*new vector<int>(1,0));
        return 1;
    }
    int max = -1, max_index = 0;
    for(int i=0;i<L.size();i++){
        if(input[i]<*(input.end()-1)){
            if(max==-1) {
                max = L[i];
                max_index=i;
            }
            else{
                if(L[i]>max) {
                    max=L[i];
                    max_index = i;
                }
            }
        }
    }
    vector<int> t = mem[max_index];
    t.push_back(input.size()-1);
    mem.push_back(t);
    L.push_back(max+1);
    return max+1;
}
int main(){
    int q;
    cout << "Type the queries number: ";
    cin >> q;
    while(q--){
        vector<int> input;
        vector<int> L;
        vector<vector<int>> mem;
        int n;
        cout << "Enter the size of vector: ";
        cin >> n;
        int max = -1;
        for(int i=0;i<n;i++){
            int temp;
            cin >> temp;
            input.push_back(temp);
            int c = calc(temp, input, L, mem);
            if(max==-1) max=c;
            else if(c>max)max=c;
        }
        cout << "Done! Maximum length of increasing subsequence is: "<< max << endl;
        for(int i=0;i<mem.size();i++)
            if(mem[i].size()==max){
                for(int j=0;j<mem[i].size();j++){
                    cout << input[mem[i][j]] << " ";
                }
                cout << endl;
                break;
            }
    }
}