Git Product home page Git Product logo

editorials's People

Contributors

samzhangqingchuan avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

editorials's Issues

希望有dfs详解,由浅入深的,谢谢

今天刚做的PDD笔试:
给定一组棍子长度,可以拼接,不能折断,问能否构成正方形(正方形有四条边,且四条边相等)
例子:
[1,1,1,1]
YES
[1,1,1,1,2,2,4,4]
YES
[1,2,3,2,1]
NO
我觉得是DFS问题,没做出来。谢谢。

树上依赖背包问题

  1. 在给的树上背包pdf文件里第5算法里, $dp_r=I_{C_r,W_r} * (\mathbf 1 + dp_{s_1}) * (\mathbf 1 + dp_{s_2}) * \dots$,为何 $*$ 的时候要加 $\mathbf 1$,而不是直接 $* dp_{s_1}$
  2. 这个泛化物品的解法,状态定义是什么
  3. 大佬能把源代码传到github上来吗?我等hdu已经半个月了,还是宕机状态,实在等不下去了

W Intervals 太巧妙了

dp[i] = max(sum[i] + dp[j] - common_sum(i, j))
= sum[i] + max(dp[j] - common_sum(i,j))

进入一个区间时 -a,离开一个区间时 +a。当走到 i 位置时,所有还没有关闭的区间 j 都会受到一个惩罚。所以在任意时刻,dp 数组维护的是 dp[j] - common_sum(i,j)。当走过最后一个区间时,由于对于任意 j,common_sum(i, j) 等于 0,所以 max(dp) 就是答案。

想看做题策略贴

不知道是不是我记错了,印象中去年你的主页上有一个google doc的链接,里面写了诸如做题熟练度大于见题的心得之类的。

我看了那个文档看到挺有收获的,但现在找不到了,希望能在看到、学习。

谢谢楼主🙏

求问算法题目

刚刚笔试完,凉了
n个数里面选k个,使得k个数相与结果最小
n<=40
1<=每个数字<=2^60
麻烦看下是什么思路,谢谢~

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.