搜索内容

题&解
  • OBCYSIO

    Orange Boy Can You Solve It Out? Ep.2

    思考题 for everyone Man on Graph You are given M chains each of N+1 nodes. We call the i-th node on the j-th chain (j,i-1). We define a bridge edge connecting (a,b) and (c,d) as follows: - a≠c - b=d - b and d don't equal to N or 0 We made sure that……
    XGN 2019-04-16
  • OBCYSIO

    Orange Boy Can You Solve It Out? Ep.1

    思考题for everyone Dynamic DP You are given: integer arrays A and dp of length N. integer arrays l and r of length N. For each 2\leq i\leq N,1\leq l_i\leq r_i\leq i-1 Known: dp_1=A_1 dp_i=min(dp[l_i,r_i])+A_i for 2\leq i\leq N. Now given q queries:……
    XGN 2019-04-14
  • 题&解

    回应赵宇“气”的问题

    我佛了,空气阻力太难力 111 空气阻力F=kv^2 所以1° 上升时 F=-kv^2-mg dv/dt=-kv^2/m-g ∫(-1/kv^2/m+g)dv=t+v0 左边应该事arctan,所以v=-tanCt+v0,,, 2° 下降时 F=mg-kv^2 ∫(1/mg-kv^2)dv=t+C 有理分式,平方差暴力拆拆↑ 答案应该与e……
    HDD 2019-04-07