buaa 1120 有误，待查

来源：互联网发布：天地图数据融合2017 编辑：程序博客网时间：2024/05/01 06:18

#include<cctype>#include<cmath>#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#include<string>#include<queue>#include<stack>#include<set>#include<map>#define REP(i,a,b) for (i=(a);i<=(b);i++)#define CLEAR(a) memset((a),0,sizeof((a)))using namespace std;typedef long long LL;const double pi = acos(-1.0);const int maxn=1e3+10;const int inf=99999999;const float eps=1e-3;typedef vector<int> Vec;int n,k,d,x;LL ans;Vec vec;map<int,Vec> mp;set<int> vis;void init();void solve();void outp();int main(){    while(cin>>n>>k>>d)        {            init();            solve();            outp();        }    return 0;}void solve(){        for(int i=0;i<vec.size();i++)        {            int tmp=0;            for(int j=0;j<mp[vec[i]].size();j++) tmp=max(tmp,((mp[vec[i]][j]-mp[vec[i]][0])/d+k)/k);            ans+=tmp;        }}void init(){    mp.clear();    vec.clear();    vis.clear();        ans=0;        for(int i=1;i<=n;i++)        {            scanf("%d",&x);            if (vis.count(x%d)<1)            {                vec.push_back(x%d);                vis.insert(x%d);            }            mp[x%d].push_back(x);        }}void outp(){    cout<<ans<<endl;}

0 0