#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; ll MOD=1000000007; ll MOD9=998244353; double inf=1e9+10; ll INF=1e18; ll dy[8]={1,0,-1,0,1,1,-1,-1}; ll dx[8]={0,1,0,-1,1,-1,1,-1}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } void solve(){ ll n;cin >> n; vl v(n);rep(i,n)cin >> v[i]; vvl dp(n,vl(n+1,INF));//i番目の要素が末尾、長さjの最小の差 rep(i,n)dp[i][1]=0; rep(i,n){ rep(j,n){//dp[i][j]->dp[k][j+1] if(idp[k][j+1] if(i> t; while(t--)solve(); }