HDU-5532Almost Sorted Array LIS问题

题意

就是检查这个序列是否删除一个元素就能变成非严格的有序序列表面上就是一个卡条件检查数组的问题

分析：

在向量中upperbound插入上界
这样能够使数组里的数列长度尽可能大
因为我们是在不断用小数替换数列中的数
大的数直接拼接到最后

code

#include<bits/stdc++.h>
#define rep(i,a,b) for(int (i) = (a);(i)<=(b);(i)++)
#define rrep(i,a,b) for(int (i) = (a);(i)>=(b);(i)--)
using namespace std;
typedef long long ll;
int a[100005],b[100005];
int main()
{int t;scanf("%d",&t);while(t--){int n,S=1,NS=1;scanf("%d",&n);rep(i,1,n)scanf("%d",a+i);vector<int>s;s.clear();s.push_back(a[1]);rep(i,2,n){if(a[i]>=s[s.size()-1])s.push_back(a[i]);else{int pos = upper_bound(s.begin(),s.end(),a[i])-s.begin();s[pos]=a[i];}}S = (int)s.size();s.clear();s.push_back(a[n]);rrep(i,n-1,1){if(a[i]>=s[s.size()-1])s.push_back(a[i]);else{int pos = upper_bound(s.begin(),s.end(),a[i])-s.begin();s[pos]=a[i];}}NS =(int)s.size();if(NS>=n-1||S>=n-1)puts("YES");else puts("NO");}return 0;
}

HDU-5532Almost Sorted Array LIS问题相关推荐

Almost Sorted Array HDU - 5532
Almost Sorted Array HDU - 5532 题意: 如果一个数组的元素"按非递减或非递增顺序排列",那么称这个数组有序.现在,LYD给了你一个数组a,他让你从中选 ...
leetcode:Search in Rotated Sorted Array
题目要求: Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 ...
Remove Duplicates from Sorted Array II -- LeetCode
原题链接: http://oj.leetcode.com/problems/remove-duplicates-from-sorted-array-ii/ 这道题跟Remove Duplicates ...
LeetCode: 108. Convert Sorted Array to Binary Search Tree
题目 Given an array where elements are sorted in ascending order, convert it to a height balanced BST. ...
【leetcode】Search in Rotated Sorted Array II（middle）☆
Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this ...
leetcode-26. Remove Duplicates from Sorted Array
今天发现一个好东西--leetcode的course ,虽然没有付费的内容会比较少,不过也很不错了. 第一篇的string讲的是两点法(Two-pointer technique),也就是数据结构课本 ...
[leetcode]Search in Rotated Sorted Array @ Python
原题地址:https://oj.leetcode.com/problems/search-in-rotated-sorted-array/ 题意: Suppose a sorted array is ...
（LeetCode 153）Find Minimum in Rotated Sorted Array
Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 migh ...
LeetCode 之 Merge Sorted Array（排序）
[问题描写叙述] Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array ...

HDU-5532Almost Sorted Array LIS问题

题意

分析：

code

HDU-5532Almost Sorted Array LIS问题相关推荐

最新文章

热门文章