이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define fr first
#define sc second
#define ARRS ((ll)(2e6+500))
#define MAX ((ll)(1e6+100))
#define MOD ((ll)1e6+7)
#define mi(a,b) a=min((a),(b))
ll n,m,k,p,l,r,q;
ll a[ARRS];
int f[1005][1005][2];
ll slv(ll i,ll c,ll e=0){
if(i==n)return 1;
if(f[i][c][e])return f[i][c][e]-1;
if(e){
f[i][c][e]=c*slv(i+1,c,e)+slv(i+1,c+1,e)+1;
return f[i][c][e]-1;
}
else {
ll pas=0;
if(a[i]==c+1){
pas+=c*slv(i+1,c,1);
pas+=slv(i+1,c+1,0);
}
else {
pas+=(a[i]-1)*slv(i+1,c,1);
pas+=slv(i+1,c,0);
}
pas%=MOD;
f[i][c][e]=pas+1;
return pas;
}
}
int main(){
#ifdef KHOKHO
freopen("in.in","r",stdin);
freopen("out.out","w",stdout);
#endif
cin>>n;
for(int i=0; i<n; i++)cin>>a[i];
cout<<slv(0,0,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... |