【CodeforcesRound#272(Div.1)C(字符串DP)_html/css_WEB-ITnose】教程文章相关的互联网学习教程文章

CodeforcesRound#235(Div.2)D.RomanandNumbers(状压dp)_html/css_WEB-ITnose

Roman and Numbers time limit per test 4 seconds memory limit per test 512 megabytes input standard input output standard output Roman is a young mathematician, very famous in Uzhland. Unfortunately,...

CodeforcesRound#283(Div.2)D.TennisGame_html/css_WEB-ITnose

标程貌似是二分? 我预处理标记了一下,然后从1到n枚举t,因为对于每个t,若s存在,那么s是唯一的,所以枚举t即可。 判断t是否合法,直接暴力的话,会超时 不知道标程大致思想是否跟我的一样,也许就是标程没有标记而是二分来找 但是,我的时间复杂度是更优的,n*(1+1/2+1/3+......1/n)=n*lnn的做法 #include#include#include#include#include#include#include#include#include#in...

CodeforcesRound#279(Div.2)d_html/css_WEB-ITnose

/** * @brief Codeforces Round #279 (Div. 2) d * @file d.cpp * @author 面码 * @created 2014/12/09 10:58 * @edited 2014/12/09 10:58 * @type math greedy * @note 自己的AC不了,参考别人的,重点是2和3都是质数,所以可以使用贪心求解。 */#include #include #include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) (...

CodeforcesRound#275(Div.2)b_html/css_WEB-ITnose

/** * @brief Codeforces Round #275 (Div. 2) b * @file b.cpp * @author 面码 * @created 2014/12/11 18:09 * @edited 2014/12/11 18:09 * @type math binary search * * */#include #include #include #include #include #include #include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))...

CodeforcesRound#275(Div.2)a_html/css_WEB-ITnose

/** * @brief Codeforces Round #275 (Div. 2) a * @file a.cpp * @author 面码 * @created 2014/12/10 15:35 * @edited 2014/12/10 15:35 * @type brute * */#include #include #include #include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))#define CLR(vec) memset(vec, 0, sizeof(ve...

CodeforcesRound#283(Div.2)a_html/css_WEB-ITnose

/** * @brief Codeforces Round #283 (Div. 2) a * @file a.cpp * @author mianma * @created 2014/12/18 17:45 * @edited 2014/12/18 17:45 * @type brute * @note */#include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))#define CLR(vec) memset(vec, 0, sizeof(vec))#ifdef DEBUGifstr...

CodeforcesRound#282(Div.2)c_html/css_WEB-ITnose

/** * @brief Codeforces Round #282 (Div. 2) c * @file c.cpp * @author mianma * @created 2014/12/16 16:09 * @edited 2014/12/16 16:09 * @type math * @note */#include #include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))#define CLR(vec) memset(vec, 0, sizeof(vec))#ifdef DE...

CodeforcesRound#282(Div.2)a_html/css_WEB-ITnose

/** * @brief Codeforces Round #282 (Div. 2) a * @file a.cpp * @author mianma * @created 2014/12/15 9:55 * @edited 2014/12/15 9:55 * @type math * @note */#include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))#define CLR(vec) memset(vec, 0, sizeof(vec))#ifdef DEBUGifstream...

CodeforcesRound#275(Div.2)c_html/css_WEB-ITnose

/** * @brief Codeforces Round #275 (Div. 2) c * @file c.cpp * @author 面码 * @created 2014/12/10 16:54 * @edited 2014/12/10 16:54 * @type math * */#include #include #include #include #include #include #include #include #include using namespace std;#define max(a, b) ((a) > (b) ? (a) : (b))#define min(a, b) ((a) > (b) ? (b) : (a)) #define abs(a) ((a) > 0 ? (a) : (0 - (a)))#define CLR(vec) ...