Taulukko

input/code.cpp: In function 'long int countNonZero(std::vector<std::vector<long int> >*)':
input/code.cpp:10:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (long i = 0; i < (*items).size(); i++) {
                      ~~^~~~~~~~~~~~~~~~~
input/code.cpp: In function 'long int countDynamic(std::vector<long int>*, int, int)':
input/code.cpp:20:27: error: 'max_element' was not declared in this scope
     vector <lVect> items(*max_element(seq->begin(), seq->end()) + 1);
                           ^~~~~~~~~~~
input/code.cpp:20:27: note: suggested alternative: 'max_align_t'
     vector <lVect> items(*max_element(seq->begin(), seq->end()) + 1);
                           ^~~~~~~~~~~
                           max_align_t
input/code.cpp:21:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (long i = 0; i < items.size(); i++) {
                      ~~^~~~~~~~~~~~~~
input/code.cpp:33:27: warning: c...

#include <iostream>
#include <vector>

using namespace std;

typedef vector <long> lVect;

long countNonZero(vector <lVect>* items) {
    long n = 0;
    for (long i = 0; i < (*items).size(); i++) {
        if ((*items)[i][1] != 0) {
            n += 1;
        }
    }
    return n;
}

long countDynamic(vector <long>* seq, int size, int k) {
    long validSublists = 0;
    vector <lVect> items(*max_element(seq->begin(), seq->end()) + 1);
    for (long i = 0; i < items.size(); i++) {
        vector <long> c = {i, 0};
        items[i] = c;
    }
    for (long j = 0; j < size; j++) {
        long index = (*seq)[j];
        // cout << "seq[j]: " << index << endl;
        items[index][1] += 1;
    }
    if (countNonZero(&items) <= k) {
        validSublists += 1;
    }
    for (long q = size; q < (*seq).size(); q++) {
        items[(*seq)[q]][1] += 1;
        items[(*seq)[q - size]][1] -= 1;
        if (countNonZero(&items) <= k) {
            validSublists += 1;
        }
    }
    return validSublists;
}

int main(int argc, const char * argv[]) {
    int arrayLength;
    int k;
    cin >> arrayLength;
    cin >> k;
    vector <long> list(arrayLength);
    for (int i = 0; i < arrayLength; i++) {
        int next;
        cin >> next;
        list[i] = next;
    }
    long sum = 0;
    for (int n = 1; n < k + 1; n++) {
        sum += list.size() - n + 1;
    }
    for (int m = k + 1; m < list.size() + 1; m++) {
        sum += countDynamic(&list, m, k);
    }
    cout << sum;
    return 0;
}