Wavel Sequence

Problem Description
Have you ever seen the wave? It’s a wonderful view of nature. Little Q is attracted to such wonderful thing, he even likes everything that looks like wave. Formally, he defines a sequence a1,a2,…,an as ”wavel” if and only if a1a3a5

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
const int max_n=2009;
const int mod=998244353;
int a[max_n],b[max_n];
int n,m,num0,num1,ans;
int once[max_n][2],sum[max_n][2];///once是指以b数组中此次状态下的的第i为作为谷态(0)和峰态(1)的个数///sum是指以b数组中之前所有的的第j位作为谷态(0)和峰态(1)的个数
int main()
{int T;scanf("%d",&T);while(T--){ans=0;memset(sum,0,sizeof(sum));scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%d",&a[i]);for(int i=1;i<=m;i++)scanf("%d",&b[i]);for(int i=1;i<=n;i++){num0=1;///表示此次作为波谷的个数，因为最开始的那个肯定要从波谷开始num1=0;///表示此次作为波峰的个数for(int j=1;j<=m;j++){if(a[i]==b[j])///两个相同的话，则进行状态的转移{once[j][0]=num0;once[j][1]=num1;ans=(ans+(once[j][0]+once[j][1])%mod)%mod;}if(a[i]>b[j])///这里作为波峰{num1=(num1+sum[j][0])%mod;///这次的可以作为波峰的加上之前的波谷}if(a[i]<b[j]){num0=(num0+sum[j][1])%mod;///这次的可以作为波谷的加上之前的波峰}}for(int j=1;j<=m;j++){if(a[i]==b[j]){sum[j][0]=(sum[j][0]+once[j][0])%mod;sum[j][1]=(sum[j][1]+once[j][1])%mod;}}}printf("%d\n",ans);}return 0;
}

HDU 6078 Wavel Sequence相关推荐

HDU 6078 Wavel Sequence （dp）
Description Have you ever seen the wave? It's a wonderful view of nature. Little Q is attracted to s ...
HDU 6078 Wavel Sequence【动态规划】
题目来戳呀 Problem Description Have you ever seen the wave? It's a wonderful view of nature. Little Q is ...
2017多校第4场 HDU 6078 Wavel Sequence DP
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=6078 题意:求两个序列的公共波形子序列的个数. 解法: 类似于最长公共上升子序列,对于每个i,只考虑存 ...
hdu 6078 Wavel Sequence
题 OvO http://acm.hdu.edu.cn/showproblem.php?pid=6078 (2017 Multi-University Training Contest - Team ...
(2017多校训练第四场)HDU - 6078 Wavel Sequence dp
传送门:点击打开链接定义状态dp[i][j][0]表示以a[i],b[j]结尾的且为波谷的情况总和,dp[i][j][1] 为波峰. 对于某个i,j满足a[i] == b[j],则dp[i][j][ ...
HDU - 6078 Wavel Sequence（动态规划+时间优化）
代码: #include<bits/stdc++.h> #define MOD 998244353 using namespace std; #define MAXN 2050int dp ...
HDU 6078 Wavel Sequence（dp）
Description 定义波浪序列:a1 > a2 < a3-,现在给出一个长度为n的序列a和一个长度为m的序列b,求a和b的公共波浪子序列个数 Input 第一行一整数T表示用例组数, ...
hud 6078 Wavel Sequence
hud 6078 Wavel Sequence 题目大意:给你两个序列a,b,让你找出两个函数 f 和 g 使得 a[f]=b[g],并且a[f1],a[f2],a[f3]--a[fk]满足序列a1 ...
HDU 1005 Number Sequence
[题目] Number Sequence Time Limit: 2000/1000 MS (Jav ...

HDU 6078 Wavel Sequence

Wavel Sequence

HDU 6078 Wavel Sequence相关推荐

最新文章

热门文章