Repository navigation
Expand file tree
/
Copy pathsubsequence.c
More file actions
85 lines (75 loc) · 1.74 KB
/
Copy pathsubsequence.c
File metadata and controls
85 lines (75 loc) · 1.74 KB
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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
#include<stdio.h>
#include<math.h>
int SubStatic(int A[],int Left,int Right)
{
int MaxLeftSum,MaxRightSum;
int MaxLeftBorderSum,MaxRightBorderSum;
int LeftBorderSum,RightBorderSum;
int Center,i;
if(Left == Right)
return 1;
Center =(Left+Right) / 2;
MaxLeftSum = SubStatic(A,Left,Center);
MaxRightSum = SubStatic(A,Center+1,Right);
if(abs(A[Center]-A[Center+1])<=2)
{
MaxLeftBorderSum = 1; LeftBorderSum = 1;
for(i=Center; i>Left; i--)
{
if(abs(A[i]-A[i-1])<=2)
LeftBorderSum++;
else
{
break;
}
if(LeftBorderSum>MaxLeftBorderSum)
MaxLeftBorderSum = LeftBorderSum;
}
MaxRightBorderSum = 1; RightBorderSum = 1;
for(i=Center+1; i<Right; i++)
{
if(abs(A[i]-A[i+1])<=2)
RightBorderSum++;
else
{
break;
}
if(RightBorderSum>MaxRightBorderSum)
MaxRightBorderSum = RightBorderSum;
}
return Max3(MaxLeftSum,MaxRightSum,MaxLeftBorderSum+MaxRightBorderSum);
}
return Max3(MaxLeftSum,MaxRightSum,1);
}
int Max3(int a,int b,int c)
{
if(a>=b)
{
if(c>=a)
return c;
else
{
return a;
}
}
else
{
if(c>=b)
return c;
else
{
return b;
}
}
}
int main()
{
int i,n;
scanf("%d",&n);
int * a=(int*)malloc(n*sizeof(int));
for(i=0;i<n;i++)
scanf("%d",&a[i]);
int MaxSubStatic = SubStatic(a,0,n-1);
printf("%d\n",MaxSubStatic);
return 0;
}