Codeforces Round #363 (Div. 2) A
简单题。
问的是,有向左和向右的两种粒子,问最早什么时候粒子会撞到一起,每次移动一个单位,并且输入的点坐标是升序的。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
int N;
char s[200005];
int x[200005];
int main()
{
scanf("%d", &N);
scanf("%s", s + 1);
for(int i=1; i<=N; i++) scanf("%d", &x[i]);
int ans = -1, las = -1;
for(int i=1; i<=N; i++)
{
if(s[i] == 'R') las = x[i];
else if(las != -1)
{
if(ans == -1) ans = x[i] - las;
else ans = min(ans, x[i] - las);
}
}
if(ans != -1) printf("%d\n", ans / 2);
else printf("-1\n");
return 0;
}