Codeforces Beta Round #14 (Div. 2) E. Camels
来源:互联网 发布:淘宝旺旺号怎么查看 编辑:程序博客网 时间:2024/05/20 16:13
dp[i][j][k][l][m]填了i位,有j个极大值点,k个极小值点,倒数第二位是数字l,倒数第一位是数字m,有多少种填法。转移的时候枚举最后一位填什么就可以了。
#include <bits/stdc++.h>using namespace std;__int64 dp[25][15][15][4][4];int n,t;int main(){scanf("%d%d",&n,&t);for(int i=0;i<4;i++)for(int j=0;j<4;j++){dp[2][0][0][i][j]=(i!=j);}for(int i=2;i<n;i++){for(int j=0;j<=i/2;j++){for(int k=0;k<=i/2;k++){for(int x=0;x<4;x++){for(int y=0;y<4;y++){if(dp[i][j][k][x][y]==0)continue;__int64 now=dp[i][j][k][x][y];for(int z=0;z<4;z++){if(z==y)continue;if(x<y){if(z<y)dp[i+1][j+1][k][y][z]+=now;elsedp[i+1][j][k][y][z]+=now;}else{if(z>y)dp[i+1][j][k+1][y][z]+=now;elsedp[i+1][j][k][y][z]+=now;}}}}}}}__int64 ans=0;for(int i=0;i<4;i++){for(int j=0;j<4;j++){ans+=dp[n][t][t-1][i][j];}}printf("%I64d\n",ans);//system("pause");return 0;}
0 0
- Codeforces Beta Round #14 (Div. 2) E. Camels
- Codeforces Beta Round #49 (Div. 2) E
- Codeforces Beta Round #63 (Div. 2) E题
- Codeforces Beta Round #69 (Div. 2 Only) E题
- Codeforces Beta Round #95 (Div. 2) A B C E
- Codeforces Beta Round #22 (Div. 2 Only) E. Scheme
- Codeforces Beta Round #46 (Div. 2) E. Common ancestor
- Codeforces Beta Round #89 (Div. 2) E. Bertown roads
- Codeforces Beta Round #57 (Div. 2) E. Enemy is weak
- Codeforces Beta Round #16 (Div. 2 Only) E. Fish
- Codeforces Beta Round #61 (Div. 2) E. Petya and Post
- Codeforces Beta Round #6 (Div. 2 Only) E. Exposition
- Codeforces Beta Round #91 (Div. 2 Only)-E. Lucky Permutation
- Codeforces Beta Round #6 (Div. 2 Only) E. Exposition
- Codeforces 14E Camels (DP)
- Codeforces Beta Round #14 (Div. 2)
- CodeForces 14 E - Camels && D - Two Paths
- codeforces 14E Camels (计数类dp)
- Excel联动菜单
- 数据库系统原理第一章总结—学习方法
- php文件上传
- Android 快速开发系列 打造万能的ListView GridView 适配器
- AFNetworking使用总结
- Codeforces Beta Round #14 (Div. 2) E. Camels
- Source Navigator和Source Insight
- groovy的简单例子
- 输入输出cin,cout用法
- acdream 1187
- 定期博客
- 大学必读
- 三月初三的萤火虫!
- 有一篇文章,共有3行文字,每行有8…