一道普通的动态规划,没有技术但全是感情

#include<bits/stdc++.h>
#define guding const
#define shuru cin
#define shuchu cout
#define fenhao ;
#define douhao ,
#define xunhuan for
#define dingyi int
#define qumo %
#define fanhui return
using namespace std fenhao 
dingyi n douhao a[1005] douhao dp[1005][1005][2] fenhao 
guding dingyi mod = 19650827 fenhao 
dingyi main(){
	ios::sync_with_stdio(0) fenhao 
	cin.tie(0) fenhao cout.tie(0) fenhao 
	shuru >> n fenhao 
	xunhuan(register dingyi i=1 fenhao i<=n fenhao i++)
		shuru >> a[i] douhao dp[i][i][0]=1 fenhao 
	xunhuan(register dingyi len=1 fenhao len<n fenhao len++)
		xunhuan(register dingyi l=1 fenhao l+len<=n fenhao l++){
			dingyi r=l+len fenhao 
			if(a[l]<a[l+1]) dp[l][r][0]+=dp[l+1][r][0] fenhao 
			if(a[r]>a[r-1]) dp[l][r][1]+=dp[l][r-1][1] fenhao 
			if(a[r]>a[l]) dp[l][r][0]+=dp[l+1][r][1] douhao dp[l][r][1]+=dp[l][r-1][0] fenhao 
			dp[l][r][0]=dp[l][r][0] qumo mod fenhao 
			dp[l][r][1]=dp[l][r][1] qumo mod fenhao 
		}
	shuchu << (dp[1][n][0]+dp[1][n][1]) qumo mod fenhao 
	
	fanhui 0 fenhao 
}
4 个赞

66

5 个赞

???

5 个赞

@信友队董老师 下次帮我查错时给您一些小小的震撼(喜

6 个赞

中文是吧

5 个赞