I. Five Day Couple

Mingming, a cute girl of ACM/ICPC team of Wuhan University, is alone since graduate from high school. Last year, she used a program to match boys and girls who took part in an active called Boy or Girl friend in five days.

She numbered n ( $0 < n \le 10^5$ ) boys from 1 to $n$, by their date of birth, and given i-th boy a number ( $0\le a_i < 10^9$ ) in almost random. (We do not mean that in your input is generated in random.). Then she numbered m ( $0 < m \le 10^5$ ) girls from 1 to m, and given i-th girl a number ( $0\le b_i < 10^9$ ) in the same way.

Also, i-th girl said that she only wanted to be matched to a boy whose age is between , which means that she should only be matched to a boy numbered from $l_i\ \mathrm{to}\ r_i$ , ( $0 < l_i \le r_i \le n$ ).

Mingming defined a rate R(i,j) to measure the score when the i-th boy and j-th girl matched. Where $R(i,j) = a_i \oplus b_i$ where $\oplus$ means bitwise exclusive or. The higher, the better.

Now, for every girl, Mingming wants to know the best matched boy, or her "Mr. Right" can be found while her . As this is the first stage of matching process and Mingming will change the result manually, two girls can have the same "Mr. Right".

#include <stdio.h> int main() { int i,n; int t; int a[100000]; int b, c, d; scanf("%d", &n); for (i = 0; i < n; i++) { scanf("%d", &a[i]); } scanf("%d", &n); while (n--) { scanf("%d %d %d", &b, &c, &d); t = a[c-1] ^ b; for (i = c; i < d; i++) { if ((b ^ a[i]) > t) t = a[i] ^ b; } printf("%d\n", t); } }

#include<iostream> using namespace std;int a[100005];int main(){int n,m;scanf("%d",&n);for(int i=1;i<=n;i++) scanf("%d",&a[i]);scanf("%d",&m);int t,l,r;while(m--){scanf("%d%d%d",&t,&l,&r);int ma=0;for(int i=l;i<=r;i++)ma=max(a[i]^t,ma);printf("%d\n",ma);}return 0;}

详情