This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define sp ' '
#define en '\n'
#define smin(a, b) a = min(a, b)
#define smax(a, b) a = max(a, b)
using namespace std;
const int N = 1e4 + 2;
const int mod = 1e6 + 7;
const int inf = 1e9;
int Add(int a, int b) {
a += b;
if (a >= mod) a -= mod;
return a;
}
int Mul(int a, int b) {
ll c = a; c *= b; c %= mod;
return c;
}
int dp[N], novo[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n; cin >> n;
int mx = 1;
for (int i = 1; i <= n; i++) {
int x; cin >> x;
if (i == 1) continue;
for (int j = 1; j <= i; j++) {
novo[j] = 0;
novo[j] = Add(dp[j - 1], Mul(dp[j], j));
}
novo[mx] = Add(novo[mx], x - 1);
for (int j = 1; j <= i; j++) dp[j] = novo[j];
smax(mx, x);
}
int ans = 1;
for (int i = 1; i <= n; i++) ans = Add(ans, dp[i]);
cout << ans << en;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |