Submission #2083417

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
ll a[20005];
int n;
int main(){
	cin>>n;
	repn(i,n) cin>>a[i];
	int ans = 0;
	for(ll t=1,c=0;c<=18;t*=10LL,c++){
		vector<ll>vec[10];
		repn(i,n){
			ll rem = a[i] % (t*10LL);
			int a = rem/t;
			vec[a].pb(rem%t);
		}
		rep(i,10) SORT(vec[i]);
		ll mn[10][10],mx[10][10];
		rep(i,10)rep(j,10){
			mn[i][j] = 1e18;
			mx[i][j] = -1e18;
		}
		rep(i,10){
			int sz = vec[i].size();
			ll S = 0;
			for(int j=0;j<=min(10,sz);j++){
				mn[i][(i*j)%10] = min(mn[i][(i*j)%10],S);
				mx[i][(i*j)%10] = max(mx[i][(i*j)%10],S);
				if(j!=sz) S += vec[i][j];
			}
			S = 0;
			rep(j,vec[i].size()) S += vec[i][j];
			for(int j=0;j<=min(10,sz);j++){
				mn[i][(i*(vec[i].size()-j))%10] = min(mn[i][(i*(vec[i].size()-j))%10],S);
				mx[i][(i*(vec[i].size()-j))%10] = max(mx[i][(i*(vec[i].size()-j))%10],S);
				if(j!=sz) S -= vec[i][j];
			}
		}
		ll dp_min[12][10],dp_max[12][10];
		rep(i,12)rep(j,10){
			dp_min[i][j] = 1e18;
			dp_max[i][j] = -1e18;
		}
		dp_min[0][0] = dp_max[0][0] = 0;
		rep(i,10){
			for(int j=0;j<10;j++){
				if(dp_min[i][j] > 5e17) continue;
				for(int k=0;k<10;k++){
					dp_min[i+1][(j+k)%10] = min(dp_min[i+1][(j+k)%10],dp_min[i][j]+mn[i][k]);
				}
			}
		}
		rep(i,10){
			for(int j=0;j<10;j++){
				if(dp_max[i][j] < -5e17) continue;
				for(int k=0;k<10;k++){
					dp_max[i+1][(j+k)%10] = max(dp_max[i+1][(j+k)%10],dp_max[i][j]+mx[i][k]);
				}
			}
		}
		int add = 0;
		for(int i=0;i<10;i++){
			ll MN = 1LL*i+dp_min[10][i]/t;
			ll MX = 1LL*i+dp_max[10][i]/t;
			for(ll j=MN;j<=MX;j++){
				add = max(add,(int)(j%10));
				if(add == 9) break;
			}
		}
		ans += add;
		//cout<<c<<" "<<add<<endl;
	}
	cout << ans << endl;
}

Submission Info

Judge Result