Даёшь ЧАЙНИКУ!!!!!! Visual studio C++

#include <algorithm>
#include <functional>
#include <iostream>
#include <locale>
#include <iostream>
#include <iterator>
 
template <typename T, template <typename> class U>
void find(const T* arr, const size_t N, const U<T>& u)
{
    typedef typename std::allocator<T>::const_pointer iterator;
    typedef typename std::iterator_traits<iterator>::difference_type difference_type;
 
        iterator curr = &arr[0], next, found = arr + N;
        difference_type max_seq = 0;
 
        for ( ; (next = std::adjacent_find(curr, arr+N, u)) != arr+N; curr = ++next)
        {
                const difference_type curr_length = std::distance(curr, next) + 1;
                if (curr_length > max_seq)
                { max_seq = curr_length; found = curr; }
        }
 
        const difference_type last_length = std::distance(curr, next);
        if (last_length > max_seq)
        { max_seq = last_length; found = curr; }
 
        std::cout << "Самая длинная последовательность:" << std::endl;
        std::copy(found, found + max_seq, std::ostream_iterator<T>(std::cout, " "));
}
 
int main()
{
    setlocale(LC_ALL, "");
 
    int arr[] = {1,2,2,-3-3,4,5,5,5,5,0,0,1,2,1,2};
    const size_t N = sizeof(arr) / sizeof(arr[0]);
 
    find(arr, N, std::not_equal_to<int>());
 
    return 0;
}