摘要:
```#include#include#include#includeusing namespace std;const int maxx = 50000 + 500;int ll,n,m;int pos[maxx];bool check(int num) //判断当最小距离为num的时候是否要拿走的石头多于M{ int cnt = 0; int last = 0; pos[0] = 0; pos... 阅读全文
摘要:
```#include#include#include#includeusing namespace std;const int maxn = 100000+5;int n,a[maxn],m;bool check(int d){ int cnt=0; for(int i = 0; i =m) return 1; else return 0;}int main(){ while(scan... 阅读全文
摘要:
```#include#include#include#include#includeconst int maxn = 1e5+10;using namespace std;long long k;int n;long long a[maxn];long long ans=0;long long maxt=0;bool check(int mid){ long long hott=0; for(i... 阅读全文
摘要:
``` #include #include #include #include #include #include #include #define pi acos(-1.0) #define ll long long int using namespace std; const int M=(int)1e5; const ll mod=(ll)1e9 + 7; const ll inf=0x3f 阅读全文