Cod sursa(job #3146146)

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

int rmq[100000][20],v[100000];

int main()
{
    FILE *fin, *fout;
    int n,m,i,put,exp,intrebare,x,y;
    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'){
        v[i]=v[i]*10+c-'0';
        c=fgetc(fin);
      }
      rmq[i][0]=v[i];
    }
    exp=1;
    for(put=1; put<n; put*=2){
      for(i=0; i<n; i++){
        if(i+put/2<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;
      put=1<<((int)log2(y-x));
      fprintf(fout, "%d\n", rmq[x][put]<rmq[y-put+1][put]?rmq[x][put]:rmq[y-put+1][put]);
    }
    fclose(fin);
    fclose(fout);
    return 0;
}