Pagini recente » Cod sursa (job #2939918) | Cod sursa (job #2726636) | Cod sursa (job #865527) | Cod sursa (job #3282661) | Cod sursa (job #813438)
Cod sursa(job #813438)
#include <fstream>
using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
long long int n,ma=0;
long long int x[100001];
long long int y[100001];
long long int aux[100001];
void verificare ()
{
long long int i;
if (y[n]>ma)
{
ma=y[n];
for (i=1;i<=n;i++)
{
y[i]=aux[i];
}
}
}
void rezolvare()
{
long long int i,j,a,contor,k;
for(i=1;i<=n;i++)
{
a=x[i];
for (j=1;j<=n;j++)
{
if(x[j]>=a)
{
a=x[j];
y[j]=y[j-1]+1;
}
else if (x[j]!=a)
{
y[j]=y[j-1];
}
//verificare();
}
for (k=1;k<=n;k++)
{
out<<y[k]<<" ";
}
out<<"\n";
}
}
int main()
{
long long int i,j;
in>>n;
for (i=1;i<=n;i++)
{
in>>x[i];
}
rezolvare();
/*for (i=1;i<=n;i++)
{
out<<aux[i]<<" ";
}
*/
return 0;
}