-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path6142.cpp
67 lines (64 loc) · 1.2 KB
/
6142.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
67
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,m;
cin>>n>>m;
int arr[n];
for(int i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
int r=0;
int l=0;
for(int i=0;i<m;i++)
{
char s;
scanf("%c",&s);
if(s=='\n')
{
i--;
continue;
}
if(s=='R') r++;
if(s=='L') l++;
}
int rmax[n];
int lmax[n];
lmax[0]=0;
rmax[n-1]=0;
for(int i=1;i<n;i++)
{
lmax[i]=max(lmax[i-1],arr[i-1]);
rmax[n-1-i]=max(rmax[n-1-i+1],arr[n-1-i+1]);
}
for(int i=0;i<n;i++)
{
if(lmax[i]<rmax[i])
{
if(lmax[i]>arr[i])
{
arr[i]+=min(lmax[i]-arr[i],l);
}
if(arr[i]<rmax[i])
{
arr[i]+=min(rmax[i]-arr[i],r);
}
}
else
{
if(arr[i]<rmax[i])
{
arr[i]+=min(rmax[i]-arr[i],r);
}
if(lmax[i]>arr[i])
{
arr[i]+=min(lmax[i]-arr[i],l);
}
}
}
for(int i=0;i<n;i++)
cout<<arr[i]<<" ";
cout<<endl;
return 0;
}