PS/cp3.cpp at master · daeroro/PS · GitHub

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
62
63
64
#include <iostream>
#include <vector>
#include <map>
#include <set>

using namespace std;

int K, L, res;
vector<int> v, d;
map<int, int> m;
map<int, int>::iterator it;
set<int> s;
set<int>::iterator sit;

int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int tmp;
    cin>>K;
    cin>>L;

    cin>>tmp;
    v.push_back(tmp);

    for(int i=1; i<L; i++)
    {
        cin>>tmp;
        v.push_back(tmp);
        d.push_back(abs(tmp-v[i-1]));
        m[abs(tmp-v[i-1])]++;
    }

    bool flag = 0;
    for(int i = 0; i<(int)d.size(); i++)
    {
        //cout<<d[i]<<' '<<m[d[i]]<<"\n";
        //cout<<it->first<<' '<<it->second<<"\n";

        if(m[d[i]]>=K)
        {
            if(flag == 0)
            {
                flag = 1;
                res+=2;
            }
            else if(flag == 1)
            {
                res+=1;
            }
        }
        else
        {
            flag = 0;
        }
        //cout<<"flag "<<flag<<' '<<res<<"\n";
    }

    cout<<L-res<<"\n";

    return 0;
}