Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|---|
117168 | 陈家宝 | 递增 | C++ | Accepted | 100 | 120 MS | 336 KB | 456 | 2023-12-22 13:51:13 |
#include<bits/stdc++.h> using namespace std; int a[114514],b[114514]; int main(){ int t,n,maxn=0; cin>>t; for(int k=1;k<=t;k++){ maxn=0; cin>>n; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++){ b[i]=1; for(int j=1;j<i;j++){ if(a[i]-i>=a[j]-j) b[i]=max(b[i],b[j]+1); } maxn=max(maxn, b[i]); } cout<<"Case #"<<k<<":"<<endl<<n-maxn<<endl; } return 0; }