-
Notifications
You must be signed in to change notification settings - Fork 0
/
lis.c
55 lines (53 loc) · 1.67 KB
/
lis.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* push_swap.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: fraqioui <marvin@42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/11/23 07:55:20 by fraqioui #+# #+# */
/* Updated: 2022/11/23 07:55:22 by fraqioui ### ########.fr */
/* */
/* ************************************************************************** */
#include "push_swap.h"
//largest increasing subsequence: LIS
//I relied on the competitive programming idea of finding the length of the LIS to develop this function. You can find out about this concept in project resources.
void ft_largest_increasing_subsequence(t_node *min, int n)
{
t_node *rstrt;
t_node *find;
int i;
int j;
i = 1;
find = min->next;
while (i < n)
{
j = 0;
rstrt = min;
while (j < i)
{
if (find->data > rstrt->data && find->pos_a < (rstrt->pos_a) + 1)
{
find->pos_a = (rstrt->pos_a) + 1;
find->link = rstrt;
}
rstrt = rstrt->next;
j++;
}
find = find->next;
i++;
}
}
//saving the LIS
void ft_save_lis(t_node *last, int n)
{
t_node *max;
int i;
max = ft_max_pos_a(last, n);
i = max->pos_a;
while (i--)
{
max->n_moves = 1;
max = max->link;
}
}