一道比较水的DP,递推关系显而易见了,不知道大牛说经典在哪里。。反正几分钟就搞完了,出奇的顺利,一把就AC
#include<stdio.h>
#include<string.h>
int main()
{
int c;
long long dp[5];
memset(dp, 0, sizeof(dp));
while (1)
{
c = getchar();
if (c == 's' || c == 'S')
dp[0]++;
if (c == 'e' || c == 'E')
{
dp[1] += dp[0];
dp[3] += dp[2];
}
if (c == 'v' || c == 'V')
dp[2] += dp[1];
if (c == 'n' || c == 'N')
dp[4] += dp[3];
if (c == '\n')
{
printf("%lld\n", dp[4]);
memset(dp, 0, sizeof(dp));
}
if (c == EOF)
break;
}
return 0;
}