大家好,又见面了,我是全栈君。
题目链接:点击打开链接
= = 990+ms卡过
#include<stdio.h> #include<iostream> #include<string.h> #include<algorithm> #include<vector> #include<set> using namespace std; #define N 100010 #define L(x) (x<<1) #define R(x) (x<<1|1) #define ll int ll n,m,k,a,b; ll x[N]; bool cmp(ll z,ll y){return z>y;} set<int>myset; set<int>::iterator p; int main(){ ll i,j; while(cin>>n){ myset.clear(); for(i=1;i<=n;i++)scanf("%d",&j),myset.insert(j); cin>>a>>b; if(a==b){puts("0");continue;} n = myset.size(); i = 1; for(p = myset.begin(); p!=myset.end(); p++,i++)x[i] = *p; sort(x+1,x+1+n,cmp); ll step = 0; ll l = 1; while(x[l]>a && l<=n)l++; while(x[l]>(a>>1) && (a-x[l])>(a-b))l++; if(l>n){cout<<a-b<<endl;continue;} while(a!=b){ step++; ll now = 1, cha = a-b; for(i = l;i<=n;i++) { if(now>=x[i])break; ll tmp = a-((a/x[i])*x[i]); if(tmp<=now || tmp>cha)continue; now = tmp; } a-=now; while(x[l]>a&&l<=n)l++; while(x[l]>(a>>1) && (a-x[l])>cha)l++; if(l>n)break; } cout<<step+a-b<<endl; } return 0; }
发布者:全栈程序员-用户IM,转载请注明出处:https://javaforall.cn/115207.html原文链接:https://javaforall.cn
【正版授权,激活自己账号】: Jetbrains全家桶Ide使用,1年售后保障,每天仅需1毛
【官方授权 正版激活】: 官方授权 正版激活 支持Jetbrains家族下所有IDE 使用个人JB账号...