Pagini recente » Cod sursa (job #2578357) | Cod sursa (job #2888562) | Cod sursa (job #1262767) | Cod sursa (job #1887518) | Cod sursa (job #1825763)
#include <fstream>
using namespace std;
int v[100006],n,i,k[100001],top;
pair < int,int > st[100005];
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
fin>>n;st[0].first=1;
for( i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
{
if(v[i]<=st[top].first)
{
st[st[0].first].first=v[i];
st[st[0].first].second=i;
st[0].first++;
}
else
{
st[st[0].first].first=v[i];
st[st[0].first].second=i;
}
top=st[0].first;
}
fout<<top<<endl;
for(i=1;i<=st[0].first;i++)
{
fout<<st[i].first<<" ";
}
return 0;
}