Cod sursa(job #1483380)
Utilizator | Raceanu Dragos-Ion Raceanud | Data | 9 septembrie 2015 10:52:17 |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<stdio.h>
void main()
{
int a[100], i, n, k=0,j;
int cop[100];
int poz;
printf("Dati lungimea vectorului:");
scanf("%d", &n);
printf("Dati vectorul:");
for (i = 1; i <= n; i++)
{
scanf("%d", &a[i]);
}
for (i = 1; i <= n; i++)
{
k = 1;
cop[k] = a[i];
for (j = i+1; j <= n; j++)
{
if (a[i] < a[j])
{
k++;
cop[k] = a[j];
i++;
}
else
if (a[i] == a[j])
{
cop[k] = a[j];
i++;
}
else
break;
}
}
for (i = 1; i <= k; i++)
{
printf("%d ", cop[i]);
}
}