SCU-4437 弱校联萌十一大决战之强力热身 B. Carries 【lower_bound 二分】
题目链接:http://acm.scu.edu.cn/soj/problem/4437/
题意:h(x,y)【x+y 进位的个数】 ,求在n个ai中枚举有多少个对数产生进位并计数。
题解:纯暴力TLE,要二分优化。
#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long LL;
const int maxn = 100100;
int n;
LL a[maxn],b[maxn];
int main(){
while(~scanf("%d",&n)){
int maxx = -1;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
maxx = maxx>a[i]?maxx:a[i];
}
int cnt1 = 0;
while(maxx){
maxx/=10;
cnt1++;
}
sort(a+1,a+1+n);
LL ans = 0;
LL mul = 1;
for(int j=1;j<=cnt1;j++){//数位
mul*=10;
for(int i=1;i<=n;i++) b[i] = a[i]%mul;
sort(b+1,b+1+n);
for(int i=1;i<n;i++){
int x = mul - b[i];
int y = lower_bound(b+i+1,b+1+n,x)-b;
if(y>n||(b[y])>mul) continue;
int z = lower_bound(b+i+1,b+1+n,mul)-b;// 记录>mul 的值
if(b[z]==mul) z++;
if(n<=z) ans += (z-y);
else ans += (n-y)+1;
}
}
printf("%lld\n",ans);
}
return 0;
}
/*
5
0 1 2 3 99
5
1 2 3 99 999
2
5 5
10
0 1 2 3 4 5 6 7 8 9
*/