pat-top 1017. The Best Peak Shape (35)

https://www.patest.cn/contests/pat-t-practise/1017

这道题首先自己写了一个O(n^2)的dp 过了。

#include <cstdio>
#include <climits>
#include <cmath>
#include <algorithm>
using namespace std;

#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=k;i>=j;i--)
#define inone(i) scanf("%d",&i)
const int maxn = 1e4 + 10;
int a[maxn], up[maxn], down[maxn], n,idx,len,offset;


int main()
{
	
	up[0] = down[n + 1] = -1;
	a[0] = a[n - 1] = INT_MIN;
	inone(n);
	rep(i, 1, n) inone(a[i]);
	rep(i, 1, n) rep(j, 1, i - 1)
			if (a[j] < a[i]) up[i] = max(up[i], up[j] + 1);

	per(i, 1, n) per(j, i + 1, n)
			if (a[j] < a[i]) down[i] = max(down[i], down[j] + 1);
	
	offset = n + 1;
	idx = len = 1;
	rep(i, 1, n)
	{
		//printf("%d: %d %d %d\n",i,up[i],down[i],a[i]);
		if (up[i] == 0 || down[i] == 0) continue;
		if (up[i] + down[i] + 1 >len) 
		{ 
			len = up[i] + down[i] + 1;  
			idx = i; 
			offset = abs(up[i] - down[i]); 
		}
		else if (up[i] + down[i] + 1 == len && offset > abs(up[i] - down[i])) 
		{
			idx = i; 
			offset = abs(up[i] - down[i]); 
		}
	}
	if (len > 1) printf("%d %d %d\n", len, idx, a[idx]);
	else printf("No peak shape\n");
	return 0;
}

后来又参考了 http://blog.csdn.net/jtjy568805874/article/details/60339007

知道了可以用树状数组做，O(nlogn)

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=k;i>=j;i--)
#define ms(x,y) memset(x,y,sizeof(x))
#define inone(i) scanf("%d",&i)

const int maxn = 3e4 + 10;
const int M = 1e4 + 1;
int a[maxn], c[maxn], up[maxn], down[maxn], n, idx, len, offset;
int lowbit(int x) { return x&-x; }

void add(int x, int y) { for (int i = x; i <= maxn; i += lowbit(i))  c[i] = max(c[i], y); } 
int sum(int x) { int res = 0; for (int i = x; i; i -= lowbit(i)) res = max(res, c[i]); return res; }
//这里sum(x)的物理意义是 以小于等于x(数值)为结尾的递增子序列的最大长度


int main()
{
	inone(n);
	rep(i, 1, n) inone(a[i]), a[i] += M;
	rep(i, 1, n)
	{
		up[i] = sum(a[i] - 1) + 1;
		add(a[i], up[i]);
	}
	ms(c, 0);
	per(i, 1, n)
	{
		down[i] = sum(a[i] - 1) + 1;
		add(a[i], down[i]);
	}
	offset = n + 1;
	idx = len = 1;
	rep(i, 1, n)
	{
		//printf("%d: %d %d %d\n",i,up[i],down[i],a[i]);
		if (up[i] == 1 || down[i] == 1) continue;
		if (up[i] + down[i] - 1 >len)
		{
			len = up[i] + down[i] - 1;
			idx = i;
			offset = abs(up[i] - down[i]);
		}
		else if (up[i] + down[i] - 1 == len && offset > abs(up[i] - down[i]))
		{
			idx = i;
			offset = abs(up[i] - down[i]);
		}
	}
	if (len > 1) printf("%d %d %d\n", len, idx, a[idx]-M);
	else printf("No peak shape\n");
	return 0;
}