다음부터는저장해두자...
-
Programmers [기지국 설치]공부/programmers 문제 2019. 10. 1. 11:32
#include #include using namespace std; int solution(int n, vector stations, int w) { int head = 0, tail = 0, answer = 0; int cur, val; for (int i = 0; i =head && tail!=0) { val = tail - head + 1; if ((val % (2 * w + 1)) == 0) val = (val / (2 * w + 1)); else val = (val / (2 * w + 1)) + 1; answer += val; } head = cur + w + 1..