fork download
copy 
  1.  
  2. #include <stdio.h>
  3.  
  4. int main() {
  5.     int n;
  6.     scanf("%d", &n);
  7.  
  8.     int a[n], lis[n];
  9.  
  10.     for (int i = 0; i < n; i++) {
  11.         scanf("%d", &a[i]);
  12.         lis[i] = 1;
  13.     }
  14.  
  15.     for (int i = 1; i < n; i++) {
  16.         for (int j = 0; j < i; j++) {
  17.             if (a[i] > a[j] && lis[i] < lis[j] + 1) {
  18.                 lis[i] = lis[j] + 1;
  19.             }
  20.         }
  21.     }
  22.  
  23.     int max = lis[0];
  24.  
  25.     for (int i = 1; i < n; i++) {
  26.         if (lis[i] > max) {
  27.             max = lis[i];
  28.         }
  29.     }
  30.  
  31.     printf("%d", n - max);
  32.  
  33.     return 0;
  34. }
  35.  
  36.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
8
10 22 9 33 21 50 41 60
stdout
copy 
3
https://ideone.com/dpsxgI
language:
C (gcc 8.3)
created:
1 day ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!