i have just started learning C++,this is my first programming language.

but i was solving some question in array,but this one was a problem to me.

here it goes.

create array,in that array find sub arrays(subset),

in which there is a maximun number in increasing order.

for example array below

10 1 2 3 0 5 2 8 6 1 9 11 12 13.

the subsets in increasing order will be

1 2 3

0 5

2 8

1 9 11 12 13

so from above example,the longest is

1 9 11 12 13

how can i do this ???

please i will appreciate for help))