Submission #3226770

---

Source Code Expand

#include <cstdio>

const int maxn=200000;

int read()
{
  int x=0,f=1;
  char ch=getchar();
  while((ch<'0')||(ch>'9'))
    {
      if(ch=='-')
        {
          f=-f;
        }
      ch=getchar();
    }
  while((ch>='0')&&(ch<='9'))
    {
      x=x*10+ch-'0';
      ch=getchar();
    }
  return x*f;
}

int n,p[maxn+10],f[maxn+10],ans;

int main()
{
  n=read();
  for(int i=1; i<=n; ++i)
    {
      p[i]=read();
      f[p[i]]=f[p[i]-1]+1;
    }
  for(int i=1; i<=n; ++i)
    {
      if(f[i]>=ans)
        {
          ans=f[i];
        }
    }
  printf("%d\n",n-ans);
  return 0;
}

Submission Info

Judge Result