摘要:
题目链接: "戳我" "推荐题解" ~~根据博弈论的基础知识,暴力搜索还是能写70分的qwq~~ 蒟蒻写个暴力都写不好,别人能拿75,我就不知道这5分到底是怎么丢的了qwqwq 先放上我的70分代码: cpp include include include include include inclu 阅读全文
摘要:
题目链接: "戳我" 用bitset优化一下floyd。。。。 如果to[i][j]==true,那么to[j][k]==1也可以转化成to[i][k]==1。 代码如下: cpp include include include include include include using names 阅读全文
该文被密码保护。 阅读全文