easy short efficient clean code
\nclass Solution {\npublic:\ntypedef long long ll;\n#define vi(x) vector<x>\nint minimumScore(const string&s, const string&t) {\n    ll m=s.size(), n=t.size(), 
```\nclass Solution {\npublic:\ntypedef long long ll;\n#define vi(x) vector<x>\nint minimumScore(const string&s, const string&t) {\n    ll m=s.size(), n=t.size(), k=n-1;\n    vi(ll)dp(n, -1);\n    for(ll l=m-1;l>-1 && k>-1;--l){\n        if(s[l]==t[k]){\n            dp[k--]=l;\n        }\n    }\n    if(k<0){\n        return 0;\n    }\n    ll ans=k+1;\n    for(ll i=0, j=0;i<m && j<n;++i){\n        if(s[i]==t[j]){\n            for(;k<n && dp[k]<=i;++k);\n            ans=max(0LL, min(ans, k - (++j)));\n        }\n    }\n    return ans;\n}\n};\n```
['C']