#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
typedef long long LL;
const int MAXN=100005;
char str[105];
int a[MAXN], tmp[MAXN];
int cnt;
int ans;
void Merge(int l,int m,int r)
{
int i = l;
int j = m + 1;
int k = l;
while(i <= m && j <= r)
{
if(a[i] > a[j])
{
tmp[k++] = a[j++];
ans += m - i + 1;
}
else
{
tmp[k++] = a[i++];
}
}
while(i <= m) tmp[k++] = a[i++];
while(j <= r) tmp[k++] = a[j++];
for(int i=l;i<=r;i++)
a[i] = tmp[i];
}
void Merge_sort(int l,int r)
{
if(l < r)
{
int m = (l + r) >> 1;
Merge_sort(l,m);
Merge_sort(m+1,r);
Merge(l,m,r);
}
}
int solve()
{
ans=0;
Merge_sort(0,cnt-1);
return ans;
}
int main()
{
int n;
while(~scanf("%d", &n))
{
int num=0;
cnt=0;
for(int i=1;i<=n;++i)
{
scanf("%s", str);
if(str[0]=='X')
num++;
else
{
int j=0;
int x=0;
int f=1;
if(str[j]=='-')
f=-1, j++;
while(str[j])
{
x=x*10+str[j]-'0';
j++;
}
a[cnt++]=x*f;
}
}
if(n==1)
{
puts("L");
continue;
}
if(num!=0)
{
if(num&1)
puts("W");
else
puts("L");
}
else
{
int ans=solve();
//printf("%d\n", ans);
if(ans&1)
puts("W");
else
puts("L");
}
}
return 0;
}
LibreOJ β Round #4 A. 游戏 找逆序对
最新推荐文章于 2019-07-08 08:42:12 发布