Can I use std::upper_bound without an underlying container?

I have a range of integers [start, end] and a non-decreasing monotonic function f(i). So conceptually, I have a non-decreasing sequence [f(start), f(start + 1), .. , f(end)]. Can I use std::upper_bound on that sequence to find the first element i in the range that holds f(i) > some_value ?

Conceptually, I'd like something like this:

std::upper_bound(start, end + 1, some_value, [&](int lhs, int rhs) { 
    return f(lhs) < f(rhs);
});

But this doesn't compile because start and end + 1 do not meet the requirements of forward iterators.