Educational Codeforces Round 90 (Rated for Div. 2) C Pluses and Minuses

You are given a string s consisting only of characters + and -. You perform some process with this string. This process can be described by the following pseudocode:

res = 0
for init = 0 to inf
cur = init
ok = true
for i = 1 to |s|
res = res + 1
if s[i] == ‘+’
cur = cur + 1
else
cur = cur - 1
if cur < 0
ok = false
break
if ok
break
Note that the inf denotes infinity, and the characters of the string are numbered from 1 to |s|.

You have to calculate the value of the res after the process ends.

Input
The first line contains one integer t (1≤t≤1000) — the number of test cases.

The only lines of each test case contains string s (1≤|s|≤106) consisting only of characters + and -.

It’s guaranteed that sum of |s| over all test cases doesn’t exceed 106.

Output
For each test case print one integer — the value of the res after the process ends.

Example
inputCopy
3
–±

+±-±
outputCopy
7
9
6

const int N = 1000005;

char s[N];

int n, v[N];

LL ans;

int main() {
    int T;
    scanf("%d", &T);
    while (T--) {
        scanf("%s", s + 1);
        n = strlen(s + 1);
        int cnt = 0, d = 2e9;
        ans = 0;
        for (int i = 0; i <= n; i++) v[i] = 2e9;
        for (int i = 1; i <= n; i++) {
            if (s[i] == '+') cnt++;
            else cnt--;
            if (cnt < 0) v[(-cnt) - 1] = min(v[- cnt - 1], i);
            d = min(d, cnt);
        }
        for (int i = n - 1; ~i; i--) v[i] = min(v[i], v[i + 1]);
        if (d >= 0) printf("%d\n", n);
        else {
            d = -d - 1;
            ans = n;
            for (int i = 0; i <= d; i++) {
                ans += v[i];
            }
            printf("%lld\n", ans);
        }
    }
    return 0;
}