本题链接：201709-2 公共钥匙盒

本博客给出本题截图：

C++

#include <iostream>
#include <algorithm>

using namespace std;

const int N = 1010;

int n, m;
int q[N];
struct Op
{
    int tm, type, id;
    bool operator< (const Op& t) const
    {
        if (tm != t.tm) return tm < t.tm;
        if (type != t.type) return type > t.type;
        return id < t.id;
    }
}op[N * 2];

int main()
{
    cin >> n >> m;
    int k = 0;
    while (m -- )
    {
        int id, start, len;
        cin >> id >> start >> len;
        op[k ++ ] = {start, 0, id};
        op[k ++ ] = {start + len, 1, id};
    }
    sort(op, op + k);

    for (int i = 1; i <= n; i ++ ) q[i] = i;

    for (int i = 0; i < k; i ++ )
    {
        int id = op[i].id;
        if (!op[i].type)
        {
            for (int j = 1; j <= n; j ++ )
                if (q[j] == id)
                {
                    q[j] = 0;
                    break;
                }
        }
        else
        {
            for (int j = 1; j <= n; j ++ )
                if (!q[j])
                {
                    q[j] = id;
                    break;
                }
        }
    }
    for (int i = 1; i <= n; i ++ )
        cout << q[i] << ' ';
    return 0;
}

  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
  
57
  
58
  
59
  
60
  
61
 

总结

水题，不解释

文章来源: chen-ac.blog.csdn.net，作者：辰chen，版权归原作者所有，如需转载，请联系作者。

原文链接：chen-ac.blog.csdn.net/article/details/120447568