Cod sursa(job #3146155)

Utilizator Tibi201eweREWR Tibi201 Data 18 august 2023 20:21:16
Problema Range minimum query Scor 100
Compilator c-64 Status done
Runda Arhiva educationala Marime 1.13 kb
#include <stdio.h>
#include <stdlib.h>
#include <math.h>

int rmq[100001][20];

int main()
{
    FILE *fin, *fout;
    int n,m,i,put,exp,intrebare,x,y,log;
    char c;
    fin=fopen("rmq.in", "r");
    fscanf(fin, "%d%d", &n, &m);
    fgetc(fin);
    for(i=0; i<n; i++){
      c=fgetc(fin);
      while(c!='\n'){
        rmq[i][0]=rmq[i][0]*10+c-'0';
        c=fgetc(fin);
      }
    }
    exp=1;
    for(put=2; put<n; put*=2){
      for(i=0; i<n; i++){
        if(i+put<n)
          rmq[i][exp]=rmq[i][exp-1]<rmq[i+put/2][exp-1]?rmq[i][exp-1]:rmq[i+put/2][exp-1];
      }
      exp++;
    }
    fout=fopen("rmq.out", "w");
    for(intrebare=0; intrebare<m; intrebare++){
      c=fgetc(fin);
      x=y=0;
      while(c!=' '){
        x=x*10+c-'0';
        c=fgetc(fin);
      }
      c=fgetc(fin);
      while(c!='\n'){
        y=y*10+c-'0';
        c=fgetc(fin);
      }
      x--;
      y--;
      i=x;
      log=31-__builtin_clz(y-x+1);
      put=1<<log;
      fprintf(fout, "%d\n", rmq[x][log]<rmq[y-put+1][log]?rmq[x][log]:rmq[y-put+1][log]);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}