package com.applovin.impl;

import com.applovin.impl.ij;
import com.applovin.impl.tf;

/* loaded from: classes.dex */
final class pq implements lj {
    private final long[] a;
    private final long[] b;
    private final long c;
    private final long d;

    @Override // com.applovin.impl.ij
    public boolean b() {
        return true;
    }

    @Override // com.applovin.impl.lj
    public long c() {
        return this.d;
    }

    @Override // com.applovin.impl.ij
    public long d() {
        return this.c;
    }

    public static pq a(long j, long j2, tf.a aVar, bh bhVar) {
        int w;
        bhVar.g(10);
        int j3 = bhVar.j();
        if (j3 <= 0) {
            return null;
        }
        int i = aVar.d;
        long c = xp.c(j3, (i >= 32000 ? 1152 : 576) * 1000000, i);
        int C = bhVar.C();
        int C2 = bhVar.C();
        int C3 = bhVar.C();
        bhVar.g(2);
        long j4 = j2 + aVar.c;
        long[] jArr = new long[C];
        long[] jArr2 = new long[C];
        int i2 = 0;
        long j5 = j2;
        while (i2 < C) {
            int i3 = C2;
            long j6 = j4;
            jArr[i2] = (i2 * c) / C;
            jArr2[i2] = Math.max(j5, j6);
            if (C3 == 1) {
                w = bhVar.w();
            } else if (C3 == 2) {
                w = bhVar.C();
            } else if (C3 == 3) {
                w = bhVar.z();
            } else {
                if (C3 != 4) {
                    return null;
                }
                w = bhVar.A();
            }
            j5 += w * i3;
            i2++;
            j4 = j6;
            C2 = i3;
        }
        if (j != -1 && j != j5) {
            pc.d("VbriSeeker", "VBRI data size mismatch: " + j + ", " + j5);
        }
        return new pq(jArr, jArr2, c, j5);
    }

    private pq(long[] jArr, long[] jArr2, long j, long j2) {
        this.a = jArr;
        this.b = jArr2;
        this.c = j;
        this.d = j2;
    }

    @Override // com.applovin.impl.ij
    public ij.a b(long j) {
        int b = xp.b(this.a, j, true, true);
        kj kjVar = new kj(this.a[b], this.b[b]);
        if (kjVar.a < j && b != this.a.length - 1) {
            int i = b + 1;
            return new ij.a(kjVar, new kj(this.a[i], this.b[i]));
        }
        return new ij.a(kjVar);
    }

    @Override // com.applovin.impl.lj
    public long a(long j) {
        return this.a[xp.b(this.b, j, true, true)];
    }
}