//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#define s second
#define pb push_back
#define f first
using namespace std;
const int N = 100005,M = 10000005;
int p[N],ans,sz[N];
int m[M];
vector <pair<int,pair<int,int> > > edges;
vector <pair<int,int> > d;
int P(int x){
if (x == p[x]) return x;
return p[x] = P(p[x]);
}
void dsu(int a,int b,int c){
int pa = P(a),pb = P(b);
if (pa == pb) return;
ans += c;
if (sz[pa] < sz[pb]) swap(pa,pb);
sz[pa]+=sz[pb];
sz[pb]=0;
p[pb] = pa;
}
int main() {
ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
int n;
cin>>n;
for (int i = 1; i <= n; i++){
int a;
cin>>a;
p[i] = i,sz[i] = 1;
d.pb({a,i});
}
sort(d.begin(),d.end());
int r = d.size() - 1;
m[10000001] = -1;
for (int i = 1e7; i >= 1; i--){
m[i] = m[i + 1];
while (r >= 0 && i <= d[r].f)
m[i] = r,r--;
}
for (int y = 0; y < n; y++){
if (y > 0 && d[y].f == d[y - 1].f)
edges.pb({0,{y,y - 1}});
if (y + 1 < n && d[y+1].f - d[y].f < d[y].f) edges.pb({d[y+1].f - d[y].f,{y,y + 1}});
if (y > 0 && d[y].f == d[y - 1].f) continue;
for (int j = d[y].f; j <= 1e7; j += d[y].f){
if (m[j] < 0) continue;
if (d[m[j]].f - j < d[y].f)
edges.pb({d[m[j]].f - j,{y,m[j]}});
}
}
sort(edges.begin(),edges.end());
for (int i=0;i<edges.size();i++){
int x = edges[i].s.f,y = edges[i].s.s,c = edges[i].f;
dsu(x,y,c);
}
cout<<ans;
}
Compilation message
sirni.cpp: In function 'int main()':
sirni.cpp:43:5: error: 'sort' was not declared in this scope; did you mean 'qsort'?
43 | sort(d.begin(),d.end());
| ^~~~
| qsort
sirni.cpp:67:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for (int i=0;i<edges.size();i++){
| ~^~~~~~~~~~~~~
