BestCoder #47 1001&&1002

來源:互聯網
上載者:User

標籤:bestcoder #47

【比賽連結】clikc here~~

ps:真是wuyu~~做了兩小時,A出兩道題,最後因為沒加longlong全部被別人hack掉!,最後居然不知道hack別人不成功也會掉分,還一個勁的hack 別人的代碼,昨天真是個悲催的比賽,~~~~(>_<)~~~~,下面弱弱獻上代碼~~

1002比1001還簡單~~

1002  Senior‘s Gun

/*BestCoder Round #471002   Senior's Gun*/#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define rep(i,j,k) for(int i=(int)j;i<=(int)k;i++)#define per(i,j,k) for(int i=(int)j;i>=(int)k;i--)typedef long long LL;typedef unsigned long long LLU;typedef double db;const int N =2*1e5+10;int n,m,t,p,res,cnt;LL ans,tmp;int num[N];int aa[N],bb[N];char str[N];bool vis[N];int main(){    scanf("%d",&t);    while (t--)    {        scanf("%d%d",&n,&m);        for (int i=1; i<=n; i++) scanf("%d",&aa[i]);        for (int i=1; i<=m; i++) scanf("%d",&bb[i]);        sort(aa+1,aa+n+1);        sort(bb+1,bb+m+1);        ans=0;        int j=n;        for (int i=1; i<=min(n,m); i++)            if(aa[j]>bb[i])            {                ans+=aa[j]-bb[i];                j--;            }            else break;        printf("%I64d\n",ans);    }    return 0;}

Sample Input
12 22 32 2
Sample Output
1

1001 Senior‘s Array

/*BestCoder Round #471002   Senior's Array*/#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;#define rep(i,j,k) for(int i=(int)j;i<=(int)k;i++)#define per(i,j,k) for(int i=(int)j;i>=(int)k;i--)typedef long long LL;typedef unsigned long long LLU;typedef double db;const int N =2*1e4+10;int n,m,t,p;int aa[N],bb[N];char str[N];bool vis[N];int main(){    scanf("%d",&t);    while (t--)    {        scanf("%d%d",&n,&p);        rep(i,1,n) scanf("%d",&aa[i]);        LL ans=-1e9;        rep(i,1,n)        {            int tmp=aa[i];            aa[i]=p;            LL now=0;            rep(j,1,n)            {                now+=(1ll)*aa[j];                if(now>ans) ans=now;                if(now<0) now=0;            }            aa[i]=tmp;        }        printf("%I64d\n",ans);    }    return 0;}


Sample Input
23 51 -1 23 -21 -1 2
Sample Output
82

著作權聲明:本文為博主原創文章,未經博主允許不得轉載。

BestCoder #47 1001&&1002

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.