Pagini recente » Cod sursa (job #3201925) | Cod sursa (job #2956299) | Cod sursa (job #2319212) | Cod sursa (job #3277569) | Cod sursa (job #1709891)
#include<fstream>
#include<vector>
using namespace std;
vector<int> v,viz;
int county=1,n,mini,sol;
int wth(int i)
{
if(i==n-1) return v[n-1];
else{
int mini=wth(i+1);
if(v[i]>=mini)
{
viz[i]=viz[i+1]*2;
if(viz[i]>=19997) viz[i]=viz[i]-19997;
return mini;
}
viz[i]=viz[i+1];
return viz[i];
}
}
int main()
{
int x;
ifstream fin("consecutive.in");
ofstream fout("consecutive.out");
fin>>n;
for(int i=0;i<n;i++)
{
fin>>x;
v.push_back(x);
viz.push_back(0);
}
mini=v[n-1];
viz[n-1]=1;
wth(0);
for(int i=0;i<=n-1;i++)
{
sol=sol+viz[i];
}
fout<<sol;
}