Chomiki

#include<stdio.h>
#define N 500001
int hamsters[5];
int hamsters1[N];
int hamsters2[N];
int hamsters3[N];
int hamsters4[N];
int hamsters5[N];
int youngest[N-1];

int main()
{
    int n, m, d, first, last;

    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &d);
        if (d == 1)
            hamsters[0]++;
        else if (d == 2)
            hamsters[1]++;
        else if (d == 3)
            hamsters[2]++;
        else if (d == 4)
            hamsters[3]++;
        else if (d == 5)
            hamsters[4]++;
        hamsters1[i] = hamsters[0];
        hamsters2[i] = hamsters[1];
        hamsters3[i] = hamsters[2];
        hamsters4[i] = hamsters[3];
        hamsters5[i] = hamsters[4];
    }
    for (int i = 0; i < m; i++) {
        scanf("%d %d", &first, &last);
        if ((hamsters1[last] - hamsters1[first-1]) >= 1)
            youngest[i] = 1;
        else if ((hamsters2[last] - hamsters2[first-1]) >= 1)
            youngest[i] = 2;
        else if ((hamsters3[last] - hamsters3[first-1]) >= 1)
            youngest[i] = 3;
        else if ((hamsters4[last] - hamsters4[first-1]) >= 1)
            youngest[i] = 4;
        else if ((hamsters5[last] - hamsters5[first-1]) >= 1)
            youngest[i] = 5;
    }
    for (int i = 0; i < m; i++)
        printf("%d\n", youngest[i]);
}