Codeforces 733E Sleep in Class

容易得出，左边的'U'（包括自己）的数量大于右边的‘D’时，从字符串右端出去，反之从左边出去，即：

if(sumu[i] <= sumd[i+1]) ans[i] += i;
else ans[i] += n-i+1;

人在字符串内做左右来回运动，所以总距离为从出发点开始的所有右‘D‘-左‘U’的距离之和，直到出去为止，两个距离可以分开来求。

代码：

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int MAXN = 1e6+5;
char s[MAXN];
int sumu[MAXN], sumd[MAXN], num[MAXN];
ll ans[MAXN];

int main() {
	memset(ans, 0, sizeof(ans));
	int n;	cin >> n;
	scanf("%s", s+1);
	sumu[0] = 0;
	for(int i = 1; i <= n; i++) {
		sumu[i] = sumu[i-1]+(s[i]=='U'?1:0);
	}
	sumd[n+1] = 0;
	for(int i = n; i >= 1; i--) {
		sumd[i] = sumd[i+1]+(s[i]=='D'?1:0);
		if(sumu[i] <= sumd[i+1]) ans[i] += i;
		else ans[i] += n-i+1;
	}
	
	int top = 0, st = 0;
	ll w = 0;
	for(int i = 1; i <= n; i++) {
		w += top-st;
		while(top-st > sumd[i]) {
			w -= i-num[st++];
		}
		ans[i] += 2*w;
		if(s[i] == 'U') num[top++] = i;
	}
	
	top = 0, st = 0, w = 0;
	for(int i = n; i >= 1; i--) {
		w += top-st;
		while(top-st > sumu[i]) {
			w -= num[st++]-i;
		}
		ans[i] += 2*w;
		if(s[i] == 'D') num[top++] = i;
	}
	
	for(int i = 1; i <= n; i++) printf("%I64d ", ans[i]);
	return 0;
}