Cod sursa(job #1623246)
Utilizator | Diac Adrian diacacmm | Data | 1 martie 2016 18:18:38 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include <fstream>
#include <stack>
#define dim 2000000000
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int main()
{
int n,max=0,j,c,size=0,i;
int v[20000000];
stack<int> s;
f>>n;
for(i=1;i<=n;i++)
{
f>>v[i];
size=0;
for(j=i;j>0;j--)
{
if(v[j]<v[i])
size++;
}
if(size>max)
{
c=i;
max=size;
}
}
s.push(v[c]);
g<<max<<"\n";
for(i=c;i>0;i--)
{
if(s.top()>v[i])
s.push(v[i]);
}
while(!s.empty()){
g<<s.top()<<" ";
s.pop();
}
return 0;
}