leetcode

0 class Solution {

1 public:

2 int maximumCostSubstring(const string &s, const string &chars, const vector<int> &vals) {

3 static int cost[27];

4

5 for (int i = 1; i <= 26; i++)

6 cost[i] = i;

7 for (int i = 0; i < size(vals); i++)

8 cost[chars[i] & 0x1F] = vals[i];

9

10 int res = 0, crnt = 0;

11 for (int i = 0; i < size(s); i++) {

12 crnt = max(0, crnt + cost[s[i] & 0x1F]);

13 res = max(res, crnt);

14 }

15

16 return res;

17 }

18 };