이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
using namespace std;
#define int long long
int mod= 1e6+7;
signed main()
{
int n;
cin>>n;
int a[n];
for (auto& i:a)
cin>>i;
int dp[n+10][n+10]={};
for (int i=1;i<=n;i++)
dp[i][n]=1;
for (int i=n-1;i>=1;i--)
{
int z=0;
for (int j=1;j<=i;j++)
{
dp[j][i]+=dp[j][i+1]+dp[j+1][i+1]+z;
dp[j][i]%=mod;
z+=dp[j][i+1];
z%=mod;
}
}
int ans=0;
for (int i=1;i<=n;i++)
{
for (int j=1;j<a[i-1];j++)
{
ans+=dp[j][i];
ans%=mod;
}
}
ans++;
ans%=mod;
cout<<ans<<endl;
}
# | 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... |