【模拟】Codeforces 699A Launch of Collider

 1 //
 2 //by coolxxx
 3 ////<bits/stdc++.h>
 4 #include<iostream>
 5 #include<algorithm>
 6 #include<string>
 7 #include<iomanip>
 8 #include<map>
 9 #include<memory.h>
10 #include<time.h>
11 #include<stdio.h>
12 #include<stdlib.h>
13 #include<string.h>
14 //#include<stdbool.h>
15 #include<math.h>
16 #define min(a,b) ((a)<(b)?(a):(b))
17 #define max(a,b) ((a)>(b)?(a):(b))
18 #define abs(a) ((a)>0?(a):(-(a)))
19 #define lowbit(a) (a&(-a))
20 #define sqr(a) ((a)*(a))
21 #define swap(a,b) ((a)^=(b),(b)^=(a),(a)^=(b))
22 #define mem(a,b) memset(a,b,sizeof(a))
23 #define eps (1e-8)
24 #define J 10
25 #define MAX 0x7f7f7f7f
26 #define PI 3.14159265358979323
27 #define N 200004
28 using namespace std;
29 typedef long long LL;
30 int cas,cass;
31 int n,m,lll,ans;
32 int a[N];
33 char s[N];
34 int main()
35 {
36     #ifndef ONLINE_JUDGE
37     freopen("1.txt","r",stdin);
38 //    freopen("2.txt","w",stdout);
39     #endif
40     int i,j;
41 //    for(scanf("%d",&cas);cas;cas--)
42 //    for(scanf("%d",&cas),cass=1;cass<=cas;cass++)
43     while(~scanf("%d",&n))
44 //    while(~scanf("%d",&n))
45     {
46         ans=MAX;
47         scanf("%s",s+1);
48         for(i=1;i<=n;i++)
49             scanf("%d",&a[i]);
50         int l=-1,r=-1;
51         for(i=1;i<=n;i++)
52         {
53             if(s[i]==‘L‘)
54             {
55                 l=a[i];
56                 if(r!=-1)ans=min((l-r)/2,ans);
57                 r=-1;
58             }
59             else
60                 r=a[i];
61         }
62         if(ans==MAX)puts("-1");
63         else printf("%d\n",ans);
64     }
65     return 0;
66 }
67 /*
68 //
69 
70 //
71 */