fork download
  1. //Lib
  2. #include<cstdio>
  3. #include<cstring>
  4. #include<cstdlib>
  5. #include<cmath>
  6. #include<ctime>
  7.  
  8. #include<iostream>
  9. #include<algorithm>
  10. #include<vector>
  11. #include<string>
  12. #include<queue>
  13. #include<stack>
  14. #include<set>
  15. #include<map>
  16. using namespace std;
  17. //Macro
  18. #define rep(i,a,b) for(int i=a,tt=b;i<=tt;++i)
  19. #define drep(i,a,b) for(int i=a,tt=b;i>=tt;--i)
  20. #define erep(i,e,x) for(int i=x;i;i=e[i].next)
  21. #define irep(i,x) for(__typeof(x.begin()) i=x.begin();i!=x.end();i++)
  22. #define read() (strtol(ipos,&ipos,10))
  23. #define sqr(x) ((x)*(x))
  24. #define pb push_back
  25. #define PS system("pause");
  26. typedef long long ll;
  27. typedef pair<int,int> pii;
  28. const int oo=~0U>>1;
  29. const double inf=1e100;
  30. const double eps=1e-6;
  31. string name="", in=".in", out=".out";
  32. //Var
  33. int n,ans,h[1008];
  34. int f[1008][1008][2];
  35. int mod=19650827;
  36. inline void Update(int &a,int b){a+=b;if(a>mod)a-=mod;}
  37. void Work()
  38. {
  39. scanf("%d",&n);
  40. rep(i,1,n)scanf("%d",h+i),f[i][i][1]=f[i][i][0]=1;
  41. rep(l,2,n)rep(i,1,n-l+1)
  42. {
  43. int j=i+l-1;
  44. if(h[i]<h[i+1])Update(f[i][j][0],f[i+1][j][0]);
  45. if(h[i]<h[j]&&i+1!=j)Update(f[i][j][0],f[i+1][j][1]);
  46. if(h[j]>h[j-1])Update(f[i][j][1],f[i][j-1][1]);
  47. if(h[j]>h[i]&&i!=j-1)Update(f[i][j][1],f[i][j-1][0]);
  48. }
  49. Update(ans,f[1][n][0]);
  50. Update(ans,f[1][n][1]);
  51. cout<<ans<<endl;
  52. }
  53. int main()
  54. {
  55. // freopen((name+in).c_str(),"r",stdin);
  56. // freopen((name+out).c_str(),"w",stdout);
  57. // Init();
  58. Work();
  59. return 0;
  60. }
Not running #stdin #stdout 0s 0KB
stdin
Standard input is empty
stdout
Standard output is empty