Pagini recente » Cod sursa (job #1787216) | Cod sursa (job #2212859) | Cod sursa (job #2980883) | Cod sursa (job #461058) | Cod sursa (job #3172832)
#include <fstream>
using namespace std;
ifstream cin ("scmax.in");
ofstream cout ("scmax.out");
int A[1001], D[1001], P[1001], I[1001];
int main()
{
int n, i, j, k;
cin >> n;
for ( i = 1; i <= n; i ++)
cin >> A[i];
k = 1;
D[k] = A[1];
P[1] = 1;
for(int i = 2 ; i <= n ; i ++)
if(A[i] > D[k])
{
D[++k] = A[i];
P[i] = k;
}
else
{
int st = 1 , dr = k , p = k + 1;
while(st <= dr)
{
int m = (st + dr) / 2;
if(D[m] > A[i])
{
p = m;
dr = m - 1;
}
else
st = m + 1;
}
D[p] = A[i];
P[i] = p;
}
j = n;
cout << k << "\n";
for(int i = k ; i >= 1 ; i --)
{
while(P[j] != i)
j --;
I[i] = j;
}
for ( i = 1; i <= k; i ++)
cout << I[i] << " ";
return 0;
}