Submission #2671756

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100 + 10;
const int M = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
const int oo = 1000000000;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
#define pb push_back 
#define all(c) (c).begin(),(c).end()
int n,v[N],level[N],vis[N],vs;
vi g[N];
vector<ii> E;
bool bfs(){
	vis[0]=++vs;
	queue<int> q;
	q.push(0);
	while(!q.empty()){
		int u=q.front();
		q.pop();
		for(int i=0; i<g[u].size(); ++i){
			int e=g[u][i];
			int d=E[e].first, c=E[e].second;
			if(!c || vis[d]==vs)continue;
			vis[d]=vs;
			level[d]=level[u]+1;
			q.push(d);
		}
	}
	return vis[101]==vs;
}
int adj[N];
int dfs(int u, int fl){
	if(u==101)
		return fl;
	for(int &i=adj[u]; i<g[u].size(); ++i){
		int e=g[u][i];
		int d=E[e].first, c=E[e].second;
		if(c && level[d]==level[u]+1){
			int cc=dfs(d, min(fl, c));
			if(cc){
				E[e].second-=cc;
				E[e^1].second+=cc;
				return cc;
			}
		}
	}
	return 0;
}
int dinic(){
	int flow=0;
	while(bfs()){
		memset(adj, 0, sizeof(adj));
		while(int cc=dfs(0, oo))
			flow+=cc;
	}
	return flow;
}
void addEdge(int a, int b, int c){
	g[a].pb(E.size());
	E.pb(ii(b,c));
	g[b].pb(E.size());
	E.pb(ii(a,0));
}
int main(){
	cin>>n;
	for(int i=1; i<=n; ++i){
		cin>>v[i];
		v[i]*=-1;
	}
	for(int i=1; i<=n; ++i)
		for(int j=i+i; j<=n; j+=i)
			addEdge(i,j,oo);
	int allpos=0;
	for(int i=1; i<=n; ++i)
		if(v[i]>=0)
			addEdge(0,i,v[i]);
		else
			addEdge(i,101,-v[i]),allpos-=v[i];
	cout<<allpos-dinic()<<endl;
	return 0;
}

Submission Info

Judge Result