Codeforces Round #378 (Div. 2) E. Sleep in Class 思维 没弄很懂

#include <cstdio>
#include <vector>
using namespace std;
typedef long long ll;
const int maxn=1000005;
int n,pre[maxn],suf[maxn],mid;
char s[maxn];
vector<ll> u,d;
ll sum1,sum2,p1,res[maxn];
int main()
{
    scanf("%d%s",&n,s+1);
    for (int i=1;i<=n;++i) {
        if (s[i]=='U')
            u.push_back(i);
        else
            d.push_back(i);
        pre[i]=pre[i-1]+(s[i]=='U');
    }
    for (int i=n;i>=1;--i)
        suf[i]=suf[i+1]+(s[i]=='D');
    mid=n+1;
    for (int i=1;i<=n;++i)
        if (pre[i-1]>suf[i+1]||(pre[i-1]==suf[i+1]&&s[i]=='U')) {
            mid=i;
            break;
        }
    if (mid-1!=(int)d.size())
        puts("123");
    sum1=sum2=0;
    for (ll i=1;i<=d.size();++i) {
        if (s[i]=='U')
            sum1+=i<<1;
        else
            sum2-=i<<1;
        sum2+=d[i-1]<<1;
        printf("%I64d\n",i+sum2-sum1);
    }
    sum1=sum2=0;
    p1=u.size();
    for (ll i=n;i>d.size();--i) {
        if (s[i]=='D')
            sum1+=(n-i)<<1;
        else
            sum2-=(n-i)<<1;
        sum2+=(n-u[--p1])<<1;
        res[i]=n-i+1+sum2-sum1;
    }
    for (int i=d.size()+1;i<=n;++i)
        printf("%I64d\n",res[i]);
    return 0;
}