- 博客(3)
- 收藏
- 关注
RSS订阅原创 CodeForces 597C_Subsequences
Description For the given sequence with n different elements find the number of increasing subsequences with k + 1 elements. It is guaranteed that the answer is not greater than 8·1018. In
2016-01-19 21:15:13
244
原创 CodeForces 602B_Approximating a Constant Range_DP
Description When Xellos was doing a practice course in university, he once had to measure the intensity of an effect that slowly approached equilibrium. A good way to determine the equilibrium inte
2016-01-19 21:06:23
260
原创 CodeForces 603A_Alternative Thinking (DP)
#include using namespace std; int n; const int MAXN = 1e5 + 10; char bin[MAXN]; int dp[MAXN][2][3];//0未1翻2远离 int lst; int maxLen; int nowLen; int Max(int a, int b){ return a > b ? a : b; } int main()
2016-01-19 20:53:21
293
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人