#include using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N; int A[10101]; map T[101010]; vector> E[101]; multiset X,Y; void add(int v) { X.insert(v); Y.insert(*X.rbegin()); X.erase(X.find(*X.rbegin())); X.insert(*Y.begin()); Y.erase(Y.begin()); if(X.size()>Y.size()+1) { Y.insert(*X.rbegin()); X.erase(X.find(*X.rbegin())); } } void del(int v) { if(X.count(v)) { X.erase(X.find(v)); if(X.size()Y.size()+1) { Y.insert(*X.rbegin()); X.erase(X.find(*X.rbegin())); } } } void solve() { int i,j,k,l,r,x,y; string s; cin>>N; FOR(i,N) cin>>A[i]; for(l=1;l<=N;l++) { for(x=0;x+l<=N;x+=l) E[x/100].push_back({x+l,x}); for(x=N-l;x>=0;x-=l) E[x/100].push_back({x+l,x}); } FOR(i,100) { sort(ALL(E[i])); int L=i*100,R=i*100; X.clear(),Y.clear(); FORR(e,E[i]) { while(e.second R; R.push_back(0); ll sum=0,ma=0; for(x=N-l;x>=0;x-=l) { sum+=T[x][x+l]; ma=max(ma,sum); R.push_back(ma); } /* cout<