Pagini recente » Cod sursa (job #313245) | Cod sursa (job #3222408) | Cod sursa (job #1897012) | Cod sursa (job #2381401) | Cod sursa (job #2118374)
#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("roboti3.in");
ofstream g("roboti3.out");
int v,n;
int main()
{ int i,j,ct,maxi,mini;
f>>v; f>>n;
if(v==1)
{ int a[200005]; a[0]=0;
for(i=1;i<=n;++i)
{ f>>a[i];
a[i+n]=a[i];
}
ct=0; maxi=0;
for(i=1;i<=2*n;++i)
if(a[i]>a[i-1])
{ ++ct; maxi=max(maxi,ct);}
else ct=1;
g<<maxi;
}
else
{ int fr[1005]={0},b[100005]={0},x,st,dr; mini=0;
for(i=1;i<=n;++i)
{ f>>x;
fr mini=min(mini,x);
}
b[1]=mini; b[n+1]=mini; st=1; dr=n+1;
fr[mini]--;
f[x]++;
if(mini==0) mini=x;
elseor(i=mini;i<=1000;++i)
while(fr[i])
{ fr[i]--;
if( b[dr] <b[st])
b[--dr]=i;
else b[++st]=i;
}
for(i=1;i<=n;++i)
g<<b[i]<<" ";
}
return 0;
}