提出 #34044573

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define ll long long
#define int ll
#define ld long double
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define REP(i,j) for(int i=0;i<j;++i)
#define REPA(i,j) for(int i=1;i<=j;++i)
#define vi vector<int>
#define pii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
using namespace std;
const int INF=0x3f3f3f3f;
const ll LINF=0x3f3f3f3f3f3f3f3f;
const ll MOD=1e9+7;
inline void read(int &x){
//	short neg=1;
	x=0;
	char c=getchar();
	/*while(c<'0'||c>'9'){
		if(c=='-')neg=-1;
		c=getchar();
	}*/
	while(c>='0'&&c<='9'){
		x=(x<<3)+(x<<1)+(c^48);
		c=getchar();
	}
//	x*=neg;
}
ll quick_mod(ll A,ll B){//A^B
    ll ret=1;
    A%=MOD;
    while(B){
        if(B&1)ret=ret*A%MOD;
        B>>=1;
        A=A*A%MOD;
    }
    return ret;
}
inline void chkmin(ll &x,ll y){x=min(x,y);}
inline void chkmax(ll &x,ll y){x=max(x,y);}
inline void add(ll &x,ll y){x=(x+y)%MOD;}
inline ll rev(ll x){return quick_mod(x,MOD-2);}
inline int lowbit(int x){return x&(-x);}

signed main(void){
	int N;
	cin>>N;
	N*=2;
	vi a(N);
	REP(i,N){
		cin>>a[i];
	}
	vi ans;
	REP(i,N-1){
		if(i&1){//down
			if(a[i]<a[i+1]){
				ans.pb(i+1);//cout<<i+1<<' ';
				swap(a[i],a[i+1]);
			}
		}
		else{//up
			if(a[i]>a[i+1]){
				ans.pb(i+1);//cout<<i+1<<' ';
				swap(a[i],a[i+1]);
			}
		}
	}
	cout<<ans.size()<<"\n";
	for(auto x:ans)cout<<x<<' ';
	return 0;
}
/*
think twice, code once;
think once, debug forever.
*/

提出情報

ジャッジ結果