Two Merged Sequences

https://codeforces.com/contest/1144/problem/G

题解：我抄的，但是

a[i]<a[i+1]

这个为什么啊？？？做了一些测试，感觉可以证明。

/*
*@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;
int 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]);vector<int>v1={-1};vector<int>v2={INF};vector<int>ans;for(int i=1;i<=n;i++){u=v1.back()<a[i];v=v2.back()>a[i];if(u&&v){if(i+1<=n){if(a[i]<a[i+1]){v1.push_back(a[i]);ans.push_back(0);}else{v2.push_back(a[i]);ans.push_back(1);}}else{v1.push_back(a[i]);ans.push_back(0);}}else if(u||v){if(u){v1.push_back(a[i]);ans.push_back(0);}else{v2.push_back(a[i]);ans.push_back(1);}}else{flag=1;break;}}if(!flag){cout<<"YES"<<endl;for(int i:ans)cout<<i<<' ';}else{cout<<"NO"<<endl;}//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

Two Merged Sequences相关推荐

Two Merged Sequences（CF 1144 G）
前言在做其它题的时候脑补到过这个题意,没想到还真有这样的题题目相关链接题目大意给一个序列,问是否能将这个序列完全划分成一个上升子序列和下降子序列数据范围 n≤2⋅105n\le2·10^5 ...
CodeForces - 1144G Two Merged Sequences
题意:给出一个序列,请将它按原顺序分别分成一个递增和一个递减的序列,不行就输出no. 思路: 由于两个序列的顺序是不变的,只是两个序列之间互相穿插,那么我们记录当前递增的序列的最大值和当前递减序列的最 ...
Two Shuffled Sequences
C. Two Shuffled Sequences time limit per test2 seconds memory limit per test256 megabytes inputstand ...
DAY1 Two Shuffled Sequences
C. Two Shuffled Sequences time limit per test2 seconds memory limit per test256 megabytes inputstand ...
C. Two Shuffled Sequences
Two integer sequences existed initially - one of them was strictly increasing, and the other one - s ...
Codeforces Round #550 (Div. 3) C.Two Shuffled Sequences
C. Two Shuffled Sequences Two integer sequences existed initially - one of them was strictly increas ...
Codeforces Round #550 (Div. 3)C. Two Shuffled Sequences
Two integer sequences existed initially - one of them was strictly increasing, and the other one - s ...
Codeforces1144C(C题）Two Shuffled Sequences
C. Two Shuffled Sequences Two integer sequences existed initially - one of them was strictly increas ...
1144C C. Two Shuffled Sequences（优先队列和set的应用）
Two integer sequences existed initially - one of them was strictly increasing, and the other one - s ...

Two Merged Sequences

Two Merged Sequences相关推荐

最新文章

热门文章