习题3.4-最长连续递增子序列-编程题

解题代码

#include<stdio.h>
#include<stdlib.h>
void Rewrite(int* longestsub, int* sequence, int last, int length);
int main()
{
	int N;//number of elements;
	scanf("%d", &N);
	int i, j;
	int sequence[100000] = { 0 }, longestsub[100000] = { 0 };
	for (i = 0; i < N; i++) scanf("%d", &sequence[i]);
	int max = 0, length = 0, temp=-1;
	for (i = 0; i < N; i++) {
		if (sequence[i] > temp) {
			length++;
			temp = sequence[i];
		}
		else {
			length = 1;
			temp = sequence[i];
		}
		if (length > max) {
			max = length;
			Rewrite(longestsub, sequence, i, max);
		}
	}
	int flag = 1;
	for (i = max-1; i >=0; i--) {
		if (flag) flag = 0;
		else printf(" ");
		printf("%d", longestsub[i]);
	}
	//printf("\nmax=%d", max);
	return 0;
}
void Rewrite(int* longestsub, int* sequence,int last,int length) {
	int i;
	for (i = 0; i < length; i++) {
		longestsub[i] = sequence[last - i];
	}
}

测试结果

问题整理

1.这题虽然简单，但是我把最长看成最大子序列。。导致还写了半个分治法。。
2.注意一下temp的更新问题，忘记更新/更新错误的问题已经出现很多次了。