QAQ! 的博客

文章目录A - Captain Flint and Crew Recruitment [思维]B - Captain Flint and a Long Voyage [思维]C - Uncle Bogdan and Country Happiness [dfs] ★★D - Captain Flint and Treasure [拓扑] ★★A -竞赛首页 Codeforces Round #660 (Div. 2)A - Captain Flint and Crew Recruitment [思.

文章目录A - XXXXX [思维]B - Sign Flipping [思维]C - Sign Flipping [思维]A - XXXXX [思维]目录题目传送门题意有 nnn 个数的数组 a[]a[]a[]，要使数组的总和%k!=0\% k != 0%k!=0可以选择删去开始的连续几个数或者删去末尾的连续几个数问这个数组满足条件的最长长度，不存在则输出 −1-1−1分析只要找到头尾最近的一个 %k!=0\% k != 0%k!=0 的数，然后扣掉这一整段的长度Code#i..

1337C - Linova and Kingdom[dfsdfsdfs][贪心]time limit per testmemory limit per testinputoutput2 seconds256 megabytesstandard inputstandard outputDescription: Writing light novels is...

1325F - Ehab’s Last Theorem[思维+dfsdfsdfs树]time limit per testmemory limit per testinputoutput1 seconds256 megabytesstandard inputstandard outputDescription: It’s the year 5555. Yo...

发现环[dfs]time limit per testmemory limit per testinputoutput1 seconds256 megabytesstandard inputstandard outputDescription: 小明的实验室有N台电脑，编号1~N。原本这N台电脑之间有N-1条数据链接相连，恰好构成一个树形网络。在树形网络上...

分考场[暴力dfs]time limit per testmemory limit per testinputoutput1 seconds256 megabytesstandard inputstandard outputDescription: n个人参加某项特殊考试。为了公平，要求任何两个认识的人不能分在同一个考场。求是少需要分几个考场才能满足条...