백준 1335번: 트럭

 

https://www.acmicpc.net/problem/13335

13335번: 트럭

큐를 이용하면 쉽게 풀리는 문제 

 

L -> 다리가 견딜수 있는 무게

W -> 다리의 길이 

 

키워드 - queue

 

Source

#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <memory.h>
using namespace std;

#define MAX_SIZE 100
#define INF 0x7fffffff
#define CENDL "\n"
#define ll long long

#define c_reverse(s) reverse(s.begin(), s.end())
#define c_sort(s) sort(s.begin(), s.end())

#define print_vector(v) for(int i=0; i<v.size(); i++) cout << v[i];

int main() {

    cin.tie(0);
    std::ios::sync_with_stdio(false);

    int n, w, l; cin >> n >> w >> l;

    queue<int> q;

    int sum, count; sum = count = 0;
    while (n--) {

        int d; cin >> d;

        while (true) {

            if (q.empty()) {
                q.push(d);
                count++;
                sum += d;
                break;
            }
            else if (q.size() == w) {
                sum -= q.front(); q.pop();
            }
            else {

                if (sum + d > l) {
                    q.push(0);
                    count++;
                }
                else {
                    q.push(d);
                    count++;
                    sum += d;
                    break;
                }
            }
        }
    }

    cout << count + w << CENDL;
    return 0;
}