1017 The Best Peak Shape (35 分)
解题思路:
emmm其实也不能算思维题,简单变形一下即可,对于一个peak shape最长子序列,无非就是从峰顶位置向两边的最长递减子序列最长,即确定一个位置i之后从两边到i的LIS最长即可,求解LIS的过程中就有求出从0到i的LIS,因此对于起点到i的LIS很简单,那么对于末尾到i的LIS呢,其实也不难,反转数组,我们就会发现这个问题又变成了从0到i的LIS,O(n2)预处理LIS数组,然后枚举每个位置,判断两个端点到他的LIS是否都>1(不能单调),是的话该位置的peak shape长度为两个端点到他的LIS之和-1,总之计算答案很简单这里不赘述了。
虽然本题不卡时间,但是仍然可以用nlogn的时间过掉,即优化LIS的过程,这里使用贪心二分的求法,lisx、lisy存储到x、y(反转数组)到各个位置最长递增子序列(详见贪心二分LIS求法),额外维护lis1、lis2用于表示两个端点到i的LIS长度便于后续计算答案。
优化前:350ms,优化后:<10ms,如果新学LIS还是推荐O(n2),dp思路很直,10000的数据,2000ms的时间明显就是让你O(n2)随便过的
代码:
O(n2)
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define G 6.67430*1e-11
#define rd read()
#define pi 3.1415926535
using namespace std;
const ll mod = 1e9 + 7;
const int MAXN = 30000005;
const int MAX2 = 300005;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch>'9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
ll fpow(ll a, ll b)
{
ll ans = 1;
while (b)
{
if (b & 1)ans = ans * a % mod;
b >>= 1;
a = a * a % mod;
}
return ans;
}
int n;
int x[200005], y[200005];
int lis1[200005], lis2[200005];
signed main()
{
int n = rd;
for (int i = 0; i < n; i++)
{
x[i] = rd;
y[n - i - 1] = x[i];//reverse
lis1[i] = lis2[i] = 1;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < i; j++)
{
if (x[i] > x[j])lis1[i] = max(lis1[i], lis1[j] + 1);
if (y[i] > y[j])lis2[i] = max(lis2[i], lis2[j] + 1);
}
}
int ma = 0, midis = 1e9, pos = 0;
for (int i = 0; i < n; i++)
{
if (lis1[i] > 1 && lis2[n - i - 1] > 1)
{
int now = lis1[i] + lis2[n - i - 1] - 1;
if (now > ma)
{
ma = now;
pos = i;
midis = abs(lis1[i] - lis2[n - i - 1]);
}
else if (now == ma&& midis > abs(lis1[i] - lis2[n - i - 1]))
{
midis = abs(lis1[i] - lis2[n - i - 1]);
pos = i;
}
}
}
if(ma)cout << ma << ' ' << pos+1 << ' ' << x[pos] << endl;
else
{
cout << "No peak shape";
}
return 0;
}
O(nlogn)
#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define pb push_back
#define G 6.67430*1e-11
#define rd read()
#define pi 3.1415926535
using namespace std;
const ll mod = 1e9 + 7;
const int MAXN = 30000005;
const int MAX2 = 300005;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch>'9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
ll fpow(ll a, ll b)
{
ll ans = 1;
while (b)
{
if (b & 1)ans = ans * a % mod;
b >>= 1;
a = a * a % mod;
}
return ans;
}
int n;
int x[200005], y[200005];
int lis1[200005], lis2[200005];
int lisx[200005], lisy[200005];
signed main()
{
int n = rd;
for (int i = 0; i < n; i++)
{
x[i] = rd;
y[n - i - 1] = x[i];//reverse
lis1[i] = lis2[i] = 1;
}
lisx[0] = x[0];
lisy[0] = y[0];
int ma1 = 1, ma2 = 1;
for (int i = 1; i < n; i++)
{
lis1[i] = lower_bound(lisx, lisx + ma1, x[i]) - lisx+1;
ma1 = max(ma1, lis1[i]);
lis2[i] = lower_bound(lisy, lisy + ma2, y[i]) - lisy+1;
ma2 = max(ma2, lis2[i]);
lisx[lis1[i]-1] = x[i];
lisy[lis2[i]-1] = y[i];
}
int ma = 0, midis = 1e9, pos = 0;
for (int i = 0; i < n; i++)
{
if (lis1[i] > 1 && lis2[n - i - 1] > 1)
{
int now = lis1[i] + lis2[n - i - 1] - 1;
if (now > ma)
{
ma = now;
pos = i;
midis = abs(lis1[i] - lis2[n - i - 1]);
}
else if (now == ma&& midis > abs(lis1[i] - lis2[n - i - 1]))
{
midis = abs(lis1[i] - lis2[n - i - 1]);
pos = i;
}
}
}
if(ma)cout << ma << ' ' << pos+1 << ' ' << x[pos] << endl;
else
{
cout << "No peak shape";
}
return 0;
}