이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000007;
int main()
{
int n;
cin>>n;
vector<int> v;
vector<int> maxi;
vector<int> dp;
for(int i=0;i<n;i++)
{
int a;
cin>>a;
v.push_back(a);
if(maxi.size())
{
maxi.push_back(max(maxi[maxi.size()-1],a));
}
else
maxi.push_back(a);
dp.push_back(1);
}
dp.push_back(1);
ll brojac=1;
for(int i=n-1;i>=0;i--)
{
int a;
if(i==0)
a=0;
else
a=maxi[i-1];
for(int j=1;j<v[i];j++)
{
brojac+=dp[max(a,j)];
brojac%=mod;
}
ll broj=dp[1];
for(int j=1;j<=i+1;j++)
{
broj+=dp[j+1];
dp[j]=broj;
broj%=mod;
dp[j]%=mod;
}
}
cout<<brojac<<endl;
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... |