Pagini recente » Cod sursa (job #2190321) | Cod sursa (job #779003) | Cod sursa (job #2354118) | Cod sursa (job #2290962) | Cod sursa (job #1021408)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("invsc.in");
ofstream g ("invsc.out");
int main()
{
long n,i;
long v[200001],sol[200001];
cin>>n;
for (i=1;i<=n;i++)
{cin>>v[i];
cout<<v[i]<<" ";}
sol[1]=2*n;
for (i=2;i<=n;i++)
if (v[i]==v[i-1])
sol[i]=sol[i-1]-1;
else
if (v[i]>v[i-1])
sol[i]=sol[i-1]+n+1;
else
sol[i]=sol[i-1]-2*n;
for (i=1;i<=n;i++)
cout<<sol[i]<<endl;
return 0;
}