D. Inversion Counting

最新推荐文章于 2022-12-10 23:49:40 发布

原创最新推荐文章于 2022-12-10 23:49:40 发布 · 379 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许也可以转载。

数学-公式专栏收录该内容

43 篇文章

订阅专栏

本文介绍了一种高效算法，用于处理给定排列及其多次区间反转查询的问题，并判断每次查询后排列中逆序对数量的奇偶性。通过计算初始逆序对数量并结合区间长度来快速更新奇偶状态。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A permutation of size n is an array of size n such that each integer from 1 to n occurs exactly once in this array. An inversion in a permutation p is a pair of indices (i, j) such that i > j and a_i < a_j. For example, a permutation [4, 1, 3, 2] contains 4 inversions: (2, 1), (3, 1), (4, 1), (4, 3).

You are given a permutation a of size n and m queries to it. Each query is represented by two indices l and r denoting that you have to reverse the segment [l, r] of the permutation. For example, if a = [1, 2, 3, 4] and a query l = 2, r = 4 is applied, then the resulting permutation is [1, 4, 3, 2].

After each query you have to determine whether the number of inversions is odd or even.

Input

The first line contains one integer n (1 ≤ n ≤ 1500) — the size of the permutation.

The second line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ n) — the elements of the permutation. These integers are pairwise distinct.

The third line contains one integer m (1 ≤ m ≤ 2·10⁵) — the number of queries to process.

Then m lines follow, i-th line containing two integers l_i, r_i (1 ≤ l_i ≤ r_i ≤ n) denoting that i-th query is to reverse a segment [l_i, r_i] of the permutation. All queries are performed one after another.

Output

Print m lines. i-th of them must be equal to odd if the number of inversions in the permutation after i-th query is odd, and even otherwise.

Examples

Input

Output

odd
even

Input

Output

odd
odd
odd
even

思路：对【l，r】转置相当于对len/2对数进行交换，（交换奇数次奇偶性改变，交换偶数次不变） len = r - l + 1

Code：

#include <bits/stdc++.h>
using namespace std;
const int AX = 1500 + 666;
int a[AX];
int main(){
	int n , q ;
	cin >> n;
	for( int i = 1 ; i <= n ; i++ ){
		cin >> a[i];
	}
	int cnt = 0;
	for( int i = 1 ; i <= n ; i++ ){
		for( int j = i + 1 ; j <= n ; j ++ ){
			if( a[j] < a[i] ){
				cnt ++ ;
			}
		}
	}
	cin >> q;
	int l , r;
	while( q-- ){
		cin >> l >> r;
		if( l == r ){
			cout << ( cnt % 2 == 0 ? "even" : "odd" ) << endl;
			continue;
		}
		int len = r - l + 1;
		len /= 2 ;
		int falg ;
		if( len % 2 == 1 ){
			if( cnt % 2 == 1 ){
				falg = 0;
				cnt = 0;
			}else{
				falg = 1;
				cnt = 1;
			}
		}else{
			if( cnt % 2 == 1 ){
				falg = 1;
				cnt = 1;
			}else{
				falg = 0;
				cnt = 0;
			}
		}
		cout << ( falg == 1 ? "odd" : "even" ) << endl;
	}
	return 0;
}