Alitaulukot

input/code.cpp: In function 'void compute()':
input/code.cpp:21:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int b = 0; b < line.size()-1; b++) {
                   ~~^~~~~~~~~~~~~~~
input/code.cpp:32:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(numf == layer.size()) { break; }
      ~~~~~^~~~~~~~~~~~~~~

#include <algorithm>
#include <bits/stdc++.h>

#define MK(x, y) std::make_pair(x, y)

int n, k, res = 0;
std::vector<std::pair<int,int> > line;

// calculate the tree
void compute() {
	int size = line.size();
	for (int a = 0; a < size; a++) {
		std::vector<std::pair<int,int> > layer;
		if (line.size() < 2 ) {
			if (line[0].first > -1 || std::max(line.data()->first, line.data()->second) - std::min(line.data()->first, line.data()->second) <= k) {
				break;
			}
		}

		int numf = 0;
		for (int b = 0; b < line.size()-1; b++) {
			int max = std::max(line[b].first, line[b+1].first);
			int min = std::min(line[b].second, line[b+1].second);
			if (min == -1 || max - min > k) {
				layer.push_back(MK(-1, -1));
				numf++;
			} else {
				layer.push_back(MK(max, min));
				res++;
			}
		}
		if(numf == layer.size()) { break; }
		line = layer;
	}
}

int main() {
	std::cin>> n >> k;
	res = n;

	if (n < 2) {
		std::cout<< n << std::endl;
		return 0;
	}

	int prev;
	std::cin>> prev;
	bool prevbool = false;
	for (int i = 0; i < n-1; i++) {
		int in;
		std::cin>> in;
		int max = std::max(prev, in), min = std::min(prev, in);
		if (max - min > k) {
			// the value wasn't right
			if (prevbool) {
				compute();
			}
			line.clear();
			line.shrink_to_fit();
			prevbool = false;
		} else {
			// the value was right
			line.push_back(MK(max, min));
			prevbool = true;
			res++;
		}
		prev = in;
	}
	if (line.size() > 0) {
		compute();
	}

	std::cout<< res << std::endl;
	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED