提出 #26586023

---

ソースコード 拡げる

/*input
10
426877385 186049196 624834740 836880476 19698398 709113743 436942115 436942115 436942115 503843678

*/
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0)
#define ALL(a) a.begin(),a.end()
#define SZ(a) ((int)a.size())
#define F first
#define S second
#define REP(i,n) for(int i=0;i<((int)n);i++)
#define eb emplace_back
#define pb push_back
#define MP(a,b) make_pair(a,b)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (int)(lower_bound(c.begin(),c.end(),x)-c.begin())
#define EL cout<<'\n'
#define BS(a,x) binary_search(ALL(a),x)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
	out<<'('<<P.F<<','<<P.S<<')';
	return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
	REP(i,SZ(V)) out<<V[i]<<((i!=SZ(V)-1)?" ":"");
	return out;
}
//}}}
const ll maxn=300005;
const ll maxlg=20;
const ll INF64=1e18;
const int INF=0x3f3f3f3f;
const ll MOD=ll(1e9+7);
const ld PI=acos(-1);
const ld eps=1e-9;
//const ll p=880301;
//const ll P=31;
mt19937 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());

ll mypow(ll a,ll b){
	ll res=1LL;
	while(b){
		if(b&1) res=res*a%MOD;
		a=a*a%MOD;
		b>>=1;
	}
	return res;
}

int a[maxn], b[maxn];

int main(){
	IOS;
	int n;
	cin>>n;
	REP(i,n) cin>>a[i];
	int state = 0;
	REP(i,n){
		if(state == 0 && i != n - 1 && a[i] > a[i + 1]){
			b[i] = 1;
			state = 1;
		}
		if(state == 1 && (i == n - 1 || a[i] < a[i + 1])){
			b[i] = 1;
			state = 0;
		}
	}
	REP(i,n) cout<<b[i]<<" \n"[i==n-1];
	return 0;
}

提出情報

ジャッジ結果