国庆集训2

国庆集训2

A:Easy h-index:对题目的理解，二分寻找答案

#include<bits/stdc++.h>
#define MAX_INT  ((unsigned)(-1)>>1)
#define MIN_INT  (~MAX_INT)
#define pi 3.1415926535898
#define ll long long
using namespace std;
int a[200052];
int n;
bool asd(int x)
{
      ll num=0;
      for(int i=x;i<=n;i++)
            num+=a[i];
      if(num>=x) return 1;
      else return 0;
}
int main(void)
{
      while(cin>>n){
            for(int i=0;i<=n;i++){
                  cin>>a[i];
            }
            int l=0,r=n;
            while(l<=r){
                  int mid=(l+r)/2;
                  if(asd(mid)) l=mid+1;
                  else r=mid-1;
            }
            cout<<r<<endl;
      }
      return 0;
}

B： Higher h-index：
题意:你有n个小时，你可以花任意的时间x(x>0)去写一篇论文，写完之后得到的论据有a*x
之后写的论文可以通过引用自己之前写的论文使得自己的论据+1，
譬如第3篇论文写的时候可以引用前面两篇使得自己的论据+2
那每一次肯定是引用自己前一篇好啊，尽量多写几篇；那么就每一个小时写一篇，每一篇的论文引用都比前一篇多一，美滋滋。
a个小时，b为X;

#include<bits/stdc++.h>
#define MAX_INT  ((unsigned)(-1)>>1)
#define MIN_INT  (~MAX_INT)
#define pi 3.1415926535898
#define ll long long
using namespace std;

int main(void)
{
      int a,b;
      while(cin>>a>>b){
            cout<<(a+b)/2<<endl;   //B = A + (N - B), B向下取整
      }
      return 0;
}

F Sorting

p[i]就是一个排序，化简后一个cmp

#include<bits/stdc++.h>
#define MAX_INT  ((unsigned)(-1)>>1)
#define MIN_INT  (~MAX_INT)
#define pi 3.1415926535898
typedef long long ll;
#define inf 0x3f3f3f3f
#define infmax 0x3f3f3f3f3f3f3f3f
using namespace std;
ll read()
{
    ll c=0;int flag=1;
    char s;
    while((s=getchar())>'9'||s<'0')if(s=='-')flag=-1;
    c=s-'0';
    while((s=getchar())<='9'&&s>='0') c=c*10+s-'0';
    return c*flag;
}
struct node
{
    ll a,b,c;
    int id;
}k[1005];
bool cmp(node a,node b)
{
    ll temp1=a.a * b.c + a.b * b.c ;
    ll temp2=b.a*a.c+b.b*a.c;
    if(temp1!=temp2)
        return temp1<temp2;
    return a.id<b.id;
}
int main(void)
{
    int t;
    while(cin>>t){
        for(int i=1;i<=t;i++){
            cin>>k[i].a>>k[i].b>>k[i].c;
            k[i].id=i;
        }
        sort(k+1,k+1+t,cmp);
        for(int i=1;i<t;i++) cout<<k[i].id<<" ";
        cout<<k[t].id<<endl;
    }
    return 0;
}

k:2018:需要枚举出4种情况出来，不能重复

#include<bits/stdc++.h>
#define MAX_INT  ((unsigned)(-1)>>1)
#define MIN_INT  (~MAX_INT)
#define pi 3.1415926535898
#define ll long long
using namespace std;

int main(void)
{
      ll a,b,c,d;
      while(cin>>a>>b>>c>>d){
            ll ans=0;
            ll x_2018=b/2018-(a-1)/2018;//x为2018的倍数
            ans+=x_2018*(d-c+1);//y的全部

            ll x_other=(b/2-(a-1)/2-x_2018);//x为偶数，但不是2018的倍数
            ans+=x_other*(d/1009-(c-1)/1009);

            ll x_1009=b/1009-(a-1)/1009-x_2018;//x为1009的倍数的奇数
            ans+=x_1009*(d/2-(c-1)/2);

            ll x_other_jishu=((b+1)/2-(a)/2-x_1009);
            ans+=x_other_jishu*(d/2018-(c-1)/2018);

            cout<<ans<<endl;
      }
      return 0;
}