k-flat sequence

k -flat sequence

A sequence {a_i } is called k- flat if for any two consecutive elements a_i and a_{i+ 1}, the following holds true: |a_i - a_{i+ 1} | ≦ k. For a given sequence, find the longest subsequence which is k- flat.

Input : (standard input)

+Line 1 contains two numbers n and k , 1 ≦ ( n , k ) ≦ 100000, where n denotes a number of elements of a sequence.

+Line 2 contains n positive integers - elements of a given sequence, all of them are not greater than 1000000000.

Output : (standard output)

Your program should print out k- flat subsequence with the maximum length .If there are more than one solution, print the one for which the last element has the smallest index, if there are more than one such solutions, print the one for which the next to last has the smallest index, etc.

Example:

For sample input:

6 3

2 9 7 2 5 8

a correct output format:

9 7 5 8

Hint: There are two 3-flat subsequences (k = 3) with four elements: 9 7 5 8 and 2 2 5 8. Both ends up with the same element (8), the next to last are also the same (5), but 7 is earlier (has smaller index) than 2 in the above example.

solution:

#include <stdio.h> #include <math.h> #include <stack> using namespace std; int data[100001]; int num[100001]; int grp[100001]; int n; int k; void kFlat() { num[0] = 1; grp[0] = 0; for(int i = 1; i < n; i++) { int max = 1; int g = i; for(int j = 0; j < i; j++) { if( abs(data[i] - data[j]) <= k ) { if ( num[j] >= max) { max = num[j] + 1; g = j; } } } num[i] = max; grp[i] = g; } int maxIndex = 0; int maxValue = 0; for(int i = 0; i < n; i++) { if(num[i] > maxValue) { maxValue = num[i]; maxIndex = i; } } stack<int> s; do { s.push(data[maxIndex]); maxIndex = grp[maxIndex]; maxValue--; } while(maxValue > 0); while(!s.empty()) { printf("%d ", s.top()); s.pop(); } printf("/n"); } int main() { scanf("%d %d", &n, &k); for(int i = 0; i < n; i++) { scanf("%d", &(data[i])); } kFlat(); return 0; }

说明：数据和是正确的， 但是序列打印有问题