552E - Vanya and Brackets - CodeForces Solution


brute force dp expression parsing greedy implementation strings *2100

Please click on ads to support us..

Python Code:

expr = list(input())
mul_pos = [-1]
add_cnt = [0] * len(expr)
for i, _ in enumerate(expr):
    add_cnt[i] = add_cnt[i - 1]      if _ == '*':
        mul_pos.append(i)
    elif _ == '+':
        add_cnt[i] += 1
mul_pos.append(len(expr))
add_cnt.append(add_cnt[-1])
add_cnt.append(0)
ans = 0
for i in range(len(mul_pos)):
    for j in range(i + 1, len(mul_pos)):
        if add_cnt[mul_pos[i]] - add_cnt[mul_pos[j]]:
            expr.insert(mul_pos[i] + 1, '(')
            expr.insert(mul_pos[j] + 1, ')')
                        ans = max(ans, eval(''.join(expr)))
            expr.pop(mul_pos[j] + 1)
            expr.pop(mul_pos[i] + 1)
print(eval(''.join(expr)) if ans == 0 else ans)


Comments

Submit
0 Comments
More Questions

2. Add Two Numbers
515. Find Largest Value in Each Tree Row
345. Reverse Vowels of a String
628. Maximum Product of Three Numbers
1526A - Mean Inequality
1526B - I Hate 1111
1881. Maximum Value after Insertion
237. Delete Node in a Linked List
27. Remove Element
39. Combination Sum
378. Kth Smallest Element in a Sorted Matrix
162. Find Peak Element
1529A - Eshag Loves Big Arrays
19. Remove Nth Node From End of List
925. Long Pressed Name
1051. Height Checker
695. Max Area of Island
402. Remove K Digits
97. Interleaving String
543. Diameter of Binary Tree
124. Binary Tree Maximum Path Sum
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
501A - Contest
160A- Twins
752. Open the Lock
1535A - Fair Playoff
1538F - Interesting Function
1920. Build Array from Permutation
494. Target Sum
797. All Paths From Source to Target