How to solve this HARD issue
1. Problem:
A non-empty zero-indexed array A consisting of N integers is given.
A peak is an array element which is larger than its neighbours. More precisely, it is an index P such that 0 < P < N − 1 and A[P − 1] < A[P] > A[P + 1].
For example, the following array A:
A[0] = 1
A[1] = 5
A[2] = 3
A[3] = 4
A[4] = 3
A[5] = 4
A[6] = 1
A[7] = 2
A[8] = 3
A[9] = 4
A[10] = 6
A[11] = 2
has exactly four peaks: elements 1, 3, 5 and 10.
You are going on a trip to a range of mountains whose relative heights are represented by array A, as shown in a figure below. You have to choose how many flags you should take with you. The goal is to set the maximum number of flags on the peaks, according to certain rules.
Flags can only be set on peaks. What's more, if you take K flags, then the distance between any two flags should be greater than or equal to K. The distance between indices P and Q is the absolute value |P − Q|.
For example, given the mountain range represented by array A, above, with N = 12, if you take:
- two flags, you can set them on peaks 1 and 5;
- three flags, you can set them on peaks 1, 5 and 10;
- four flags, you can set only three flags, on peaks 1, 5 and 10.
You can therefore set a maximum of three flags in this case.
Write a function:
int solution(int A[], int N);
that, given a non-empty zero-indexed array A of N integers, returns the maximum number of flags that can be set on the peaks of the array.
For example, the following array A:
A[0] = 1
A[1] = 5
A[2] = 3
A[3] = 4
A[4] = 3
A[5] = 4
A[6] = 1
A[7] = 2
A[8] = 3
A[9] = 4
A[10] = 6
A[11] = 2
the function should return 3, as explained above.
Assume that:
- N is an integer within the range [1..200,000];
- each element of array A is an integer within the range [0..1,000,000,000].
Complexity:
- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
Elements of input arrays can be modified.
// you can write to stdout for debugging purposes, e.g.
// printf("this is a debug message\n"); int solution(int A[], int N) {
// write your code in C99
int i = ;
// 每一个节点是否为peak
int isPeak[N];
isPeak[]=;
isPeak[N-]=;
// peak个数
int count = ;
for(i=;i<N-;i++)
{
if(A[i]>A[i-]&&A[i]>A[i+])
{
isPeak[i]=;
count++;
}
else
{
isPeak[i]=;
}
}
//如果peak为0，那么直接退出没商量
if(count == )
{
return ;
}
//放入相应peak的位置。
int peak[count]; int j=;
for(i=;i<N;i++)
{
if(isPeak[i]==)
{
peak[j]=i;
j++;
}
} int dis = peak[count-]-peak[]; //最大可能k
int maxk =;
while((maxk-)*maxk<dis)
{
maxk++;
}
if((maxk-)*maxk!=dis)
maxk--; // 存入在i节点处下一个peak的位置，如果不存在下一个peak，为-1；
int nextpeak[N]; j=count-;
int temp = -;
for(i=N-;i>;i--)
{
if(i>peak[j])
{
nextpeak[i]=temp;
}
else
{
temp = peak[j];
j--;
nextpeak[i]=temp;
}
// printf("%d ",nextpeak[i]);
} //从 maxk，向下搜索，直到找出一个i(k)满足条件
int start = peak[];
int nodes = ;
for(i=maxk;i>;i--)
{
while(nodes<i)
{
start = start+i;
if(start > N-)
{
break;
}
start = nextpeak[start];
// printf("\n%d ",start);
if(start == -)
{
break;
}
else
{
nodes++;
}
}
if(nodes == i)
{
return i;
}
else
{
nodes = ;
start = peak[];
}
} return nodes;
}