1001
#include <bits/stdc++.h>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
const int maxn=2e3+9;
int n,m,rt[maxn],cnt,b[maxn],a[maxn],tot;
struct Node{
int l,r,val;
}tr[maxn*20];
inline void build(int &k,int l,int r){
k=++cnt;
if(l==r)return;
int mid=(l+r)>>1;
build(tr[k].l,l,mid),build(tr[k].r,mid+1,r);
}
inline void change(int &k,int kk,int l,int r,int val){
k=++cnt,tr[k]=tr[kk],tr[k].val+=1;
if(l==r)return ;
int mid=(l+r)>>1;
if(val<=mid)change(tr[k].l,tr[kk].l,l,mid,val);
else change(tr[k].r,tr[kk].r,mid+1,r,val);
}
inline int query(int nl,int nr,int l,int r,int k){
int x=tr[tr[nr].l].val-tr[tr[nl].l].val;
if(l==r)return b[l];
int mid=(l+r)>>1;
if(x>=k)return query(tr[nl].l,tr[nr].l,l,mid,k);
return query(tr[nl].r,tr[nr].r,mid+1,r,k-x);
}
ll f[109][109][109];
ll dfs(ll l,ll r,ll cs){
if(f[l][r][cs])return f[l][r][cs];
if(cs==1){
int len=r-l+1;
return f[l][r][cs]=query(rt[l-1],rt[r],1,tot,len-len/20);
}
ll res=0x3f3f3f3f;
for(int i=l;i<n;++i){
res=min(res,dfs(l,i,1)+dfs(i+1,n,cs-1));
}
//cout<<l<<"::"<<r<<"__"<<cs<<"||"<<res<<"\n";
return f[l][r][cs]=res;
}
void solve(){
memset(tr,0,sizeof(tr));
memset(f,0,sizeof(f));
cin>>n>>m;
f(i,1,n)cin>>a[i],b[i]=a[i];
sort(b+1,b+1+n);
tot=unique(b+1,b+n+1)-(b+1);
build(rt[0],1,tot);
f(i,1,n){
int now=lower_bound(b+1,b+1+tot,a[i])-b;
change(rt[i],rt[i-1],1,tot,now);
}
cout<<dfs(1,n,m)<<"\n";
}
ll tt;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>tt;
f(sb,1,tt)solve();
return 0;
}
1002
#include <bits/stdc++.h>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using namespace std;
const double eps = 1e-10;
const double pi = 3.1415926535897932384626433832795;
const double eln = 2.718281828459045235360287471352;
#define f(i, a, b) for (int i = a; i <= b; i++)
#define scan(x) scanf("%d", &x)
#define mp make_pair
#define pb push_back
#define lowbit(x) (x&(-x))
#define fi first
#define se second
#define SZ(x) int((x).size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define summ(a) (accumulate(all(a), 0ll))
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
using ll=long long;
ll tt,n,a[(int)1e6+9],k1,k2,p;
bitset<(int)1e6+9> vis;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>tt;
f(sb,1,tt){
vis.reset();
cin>>n;
f(i,1,n)cin>>a[i];
cin>>k1>>k2>>p;
__int128 res1=0,res2=0,base=100;
for(int i=1;i<=k2;++i)res2+=a[i];
for(int i=k2-k1+1;i<=k2;++i)res1+=a[i];
vis[k2]=k1*res2*p>res1*k2*base;
for(int i=k2+1;i<=n;++i){
res1-=a[i-k1];
res2-=a[i-k2];
res1+=a[i],res2+=a[i];
vis[i]=k1*res2*p>res1*k2*base;
//cout<<i<<"::"<<(long long)(base*(res2*k1-res1*k2)-k1*k2*p)<<"\n";
}
f(i,1,n)cout<<vis[i];
cout<<"\n";
}
return 0;
}
1007
#include <bits/stdc++.h>
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
*/
using namespace std;
#define all(x) x.begin(), x.end()
#define f(i, a, b) for (int i = a; i <= b; i++)
using ll=long long;
long long tt,p,q;
void solve(){
cin>>p>>q;
if(p==1&&q==1){
cout<<"sc\n";
return;
}
int cnt=1,qsb=q;
string ans="";
while(!(p==1&&q==1)){
ll fm=q-p,fz=p;
if(fm>fz)ans+="s";
else ans+="c";
p=min(fz,fm),q=max(fz,fm);
}
if(p==1&&q==1&&ans.size()<qsb){
cout<<"sc";
reverse(all(ans));
for(auto it:ans)cout<<"t"<<it;
cout<<"\n";
}
else cout<<"Noooooooo!\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>tt;
f(S,1,tt)solve();
return 0;
}
