#include <bits/stdc++.h> #define int long long using namespace std; int MOD = 1e9+7; int memo[1010][1010]; int maxi[1010]; int n; int dp(int pos,int largest){ if (pos == n) return 1; if (memo[pos][largest] != -1) return memo[pos][largest]; int ans = (largest*dp(pos+1,largest))%MOD; if (maxi[pos] > largest) ans += dp(pos+1,largest+1); return memo[pos][largest] = ans%MOD; } main(){ cin >> n; for (int i = 0; i < n; i++){ int x; cin >> x; if (i == 0) maxi[i] = x; else maxi[i] = max(maxi[i-1],x); } for (int i = 0; i < 1010; i++) for (int j = 0; j < 1010; j++) memo[i][j] =-1; cout << dp(0,0); }

teams.cpp:15:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^