笔试强训day02

---

牛牛的快递

import math
a,b = input().split()
a = float(a)
price = 20
if a>1:
    price += math.ceil(a)-1
if b=='y':
    price += 5
print(price)

---

---

最小花费爬楼梯

from functools import cache
import sys
sys.setrecursionlimit(300000)
n = int(input())
a = [int(x) for x in input().split()]
@cache
def dfs(u:int)->int:
    if u<=1:
        return 0
    else:
        return min(dfs(u-1)+a[u-1],dfs(u-2)+a[u-2])
print(dfs(n))

#include <bits/stdc++.h>
const int N = 1e5+10;
int cost[N];
int n;
int dp[N];

int main()
{
    std::cin>>n;    
    for(int i = 0;i<n;++i)std::cin>>cost[i];
    for(int i = 2;i<=n;++i)
    {
        dp[i] = std::min(dp[i-1]+cost[i-1],dp[i-2]+cost[i-2]);
    }
    std::cout<<dp[n]<<std::endl;
    return 0;
}

---

---

数组中两个字符串的最小距离

from math import *
t = int(input())
s1,s2 = input().split()
idx1,idx2 = -1,-1
ans = inf
for _ in range(t):
    s = input()
    if s1 == s:
        idx1 = _
    elif s2 == s:
        idx2 = _
    if idx1 !=-1 and idx2 != -1:
        ans = min(ans,abs(idx1-idx2))
print(-1 if ans == inf else ans)

---