Increasing Subsequence (easy version)

https://codeforces.com/contest/1157/problem/C1

题意：给一个不重复的元素的数组，每次可以在头或者尾取一个数，求取数最长严格递增序列的方法

题解：因为元素不重复，每次选大于上一个值，而且绝对值相对较小的

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=200000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
string ans,cnt,flag,temp,sum;
int a[N];
char str;
struct node{};
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]);l=1;r=n;int now=0;while(l<=r){bool u=a[l]>now;bool v=a[r]>now;if(u&&v){if(a[l]-now<a[r]-now){ans+='L';now=a[l++];}else{ans+='R';now=a[r--];}}else if(u||v){if(u){ans+='L';now=a[l++];}else{ans+='R';now=a[r--];}}else{break;}}cout<<ans.size()<<endl;cout<<ans<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Increasing Subsequence (easy version)相关推荐

Codeforces Round #555 (Div. 3), problem: (C2) Increasing Subsequence (hard version)【贪心+撞到南墙也不回头】
题目链接题目大意复杂版大意是我们可以从左右两端每次拿走一个数,一直拿,不过要满足一个条件,每次拿的数要保证严格递增(即从小到大然后不会有相同的情况) 复杂版的话是会有相同的数字出现在题解中正式说 ...
Increasing Subsequence (hard version)
https://codeforces.com/contest/1157/problem/C2 题意:给一个存在重复的元素的数组,每次可以在头或者尾取一个数,求取数最长严格递增序列的方法题解:因为如果 ...
Codeforces Round # 555 (Div. 3) C2. Increasing subsequence (complicated version) (贪心)
题目链接:http://codeforces.com/contest/1157/problem/C2 当左右两边数字相同时,需要判断一下取哪边能得到更长的递增序列 #include <iostr ...
D1. Kirk and a Binary String (easy version)
题目链接:http://codeforces.com/contest/1204/problem/D1 D1. Kirk and a Binary String (easy version) time ...
HPU第三次积分赛-D：Longest Increasing Subsequence（DP）
Longest Increasing Subsequence 描述给出一组长度为n的序列,a1,a2,a3,a4...an, 求出这个序列长度为k的严格递增子序列的个数输入第一行输入T ...
[Swift]LeetCode673. 最长递增子序列的个数 | Number of Longest Increasing Subsequence
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
The Longest Increasing Subsequence (LIS)
传送门 The task is to find the length of the longest subsequence in a given array of integers such that ...
674 Longest Continuous Increasing Subsequence（每日一题）
674:Longest Continuous Increasing Subsequence 每日一题的第一天解题思路双重循环 class Solution {public int findLeng ...
C++longest increasing subsequence 最长递增子序列的实现之二(附完整源码)
C++longest increasing subsequence 最长递增子序列的实现 C++longest increasing subsequence 最长递增子序列的的实现完整源码(定义,实现 ...

Increasing Subsequence (easy version)

Increasing Subsequence (easy version)相关推荐

最新文章

热门文章