OJ Board

Hi,

I modified my source code by using your fucntion (that prints the LIS).
Here is the new code :

[c]#include <stdio.h>
#include <iostream.h>
#include <conio.h>
#define NMAX 100

int N; //sequence length
int height[NMAX];
int length[NAMAX];
int predecessor[NMAX];

int maxarr(int t[],int n ...

Hey all,

This time I need some help about the famous LIS problem.. Well, I found an algorithm that finds the LIS, but don't know how to procede to reconstruct the subsequence. Here is the code :

[c]
#include <stdio.h>
#include <iostream.h>
#include <conio.h>

void main()
{
int height[10];
int ...

Hey all,
I need to know to use the qsort() function.. especially the sort_function(const void *a, const void *b) that is used by qsort()...
Thank you