0
点赞
收藏
分享

微信扫一扫

Codeforces 1352 D. Alice, Bob and Candies

十里一走马 2023-02-03 阅读 78


Codeforces 1352 D. Alice, Bob and Candies_比赛


Codeforces 1352 D. Alice, Bob and Candies_比赛_02


按照题意模拟,注意细节即可。

AC代码:

const int N = 2e5 + 10;
int n, m, k;
int a[N];
int cnt, res, sum, ans1, ans2;
int main()
{
int t;
sd(t);
while (t--)
{
sd(n);
rep(i, 1, n)
sd(a[i]);
cnt = 0, ans1 = 0, ans2 = 0;
sum = 0;
int l = 1, r = n;
bool flag = 0;
while (l <= r)
{
res = 0;
while (l <= r)
{
flag = 1;
res += a[l];
ans1 += a[l];
l++;
if (res > sum)
{
sum = res;
break;
}
}
if (flag)
cnt++;
res = 0;
flag = 0;
while (l <= r)
{
flag = 1;
res += a[r];
ans2 += a[r];
r--;
if (res > sum)
{
sum = res;
break;
}
}
if (flag)
cnt++;
}
pddd(cnt, ans1, ans2);
}
return 0;
}


举报

相关推荐

0 条评论