Codeforces Round #363 (Div. 2)

最近太忙了时间不够, 4个1a 记录一下代码剩4题有空补做吧

 1 //#define txtout
 2 //#define debug
 3 #include<bits/stdc++.h>
 4 #define mt(a,b) memset(a,b,sizeof(a))
 5 using namespace std;
 6 typedef long long LL;
 7 const double pi=acos(-1.0);
 8 const double eps=1e-8;
 9 const int inf=0x3f3f3f3f;
10 const int M=2e5+10;
11 int n;
12 char a[M];
13 int b[M];
14 int solve(){
15     int answer=inf;
16     for(int i=0;i<n;i++){
17         if(a[i]=='L') continue;
18         int last=i;
19         for(int j=i;j<n;j++){
20             if(a[j]=='L') break;
21             last=j;
22         }
23         if(last==n-1) break;
24         answer=min(answer,(b[last+1]-b[last])/2);
25         i=last;
26     }
27     if(answer==inf) answer=-1;
28     return answer;
29 }
30 int main(){
31     #ifdef txtout
32     freopen("in.txt","r",stdin);
33     freopen("out.txt","w",stdout);
34     #endif // txtout
35     while(~scanf("%d%s",&n,a)){
36         for(int i=0;i<n;i++){
37             scanf("%d",&b[i]);
38         }
39         printf("%d\n",solve());
40     }
41     return 0;
42 }

View Code