Cod sursa(job #2837777)
| Utilizator | Data | 22 ianuarie 2022 16:14:00 | |
|---|---|---|---|
| Problema | Xor Max | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <stdio.h>
int x[ 100010 ];
int n;
int main()
{
int maxx = -10, left, right;
FILE *fin = fopen( "xormax.in", "r" );
fscanf( fin, "%d", &n );
for( int i = 1; i <= n; i++ ) {
fscanf( fin, "%d", &x[ i ] );
x[ i ] ^= x[ i - 1 ];
for( int j = i - 1; j >= 0; j-- )
if( maxx < ( x[ i ] ^ x[ j ] ) ) {
maxx = ( x[ i ] ^ x[ j ] );
left = j + 1;
right = i;
}
}
fclose( fin );
FILE *fout = fopen( "xormax.out", "w" );
fprintf( fout, "%d %d %d\n", maxx, left, right );
fclose( fout );
return 0;
}