-
Notifications
You must be signed in to change notification settings - Fork 0
/
11157.cpp
66 lines (57 loc) · 949 Bytes
/
11157.cpp
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
65
66
#include <iostream>
using namespace std;
bool isSmall[110],hit[110];
int pos[110];
int dist(int n)
{
int mn=pos[0];
for(int i=0;i<n;i++)
{
hit[i]=true;
if(!isSmall[i+1])
{
mn=max(mn,pos[i+1]-pos[i]);
}
else
{
mn=max(mn,pos[i+2]-pos[i]);
++i;
}
}
for(int i=n;i>0;--i)
{
if(!hit[i-1] || !isSmall[i-1])
{
mn=max(mn,pos[i]-pos[i-1]);
}
else
{
mn=max(mn,pos[i]-pos[i-2]);
--i;
}
}
return mn;
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
char a,b;
int t,n,d,c=1;
cin>>t;
while(t--)
{
cin>>n>>d;
for(int i=0;i<n;i++)
{
cin>>a>>b>>pos[i];
isSmall[i]=(a=='S');
hit[i]=false;
}
isSmall[n]=false;
pos[n]=d;
hit[n]=false;
cout<<"Case "<<c++<<": "<<dist(n)<<"\n";
}
return 0;
}