当前位置:网站首页>Flipping game (enumeration)
Flipping game (enumeration)
2022-07-07 19:11:00 【Full stack programmer webmaster】
Hello everyone , I meet you again , I'm the king of the whole stack .
Flipping Game
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Iahub got bored, so he invented a game to be played on paper.
He writes n integers a1, a2, …, an. Each of those integers can be either 0 or 1. He’s allowed to do exactly one move: he chooses two indices i and j (1 ≤ i ≤ j ≤ n) and flips all values ak for which their positions are in range [i, j] (that is i ≤ k ≤ j). Flip the value of x means to apply operation x = 1 – x.
The goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.
Input
The first line of the input contains an integer n (1 ≤ n ≤ 100). In the second line of the input there are n integers: a1, a2, …, an. It is guaranteed that each of those n values is either 0 or 1.
Output
Print an integer — the maximal number of 1s that can be obtained after exactly one move.
Sample test(s)
Input
5
1 0 0 1 0
Output
4
Input
4
1 0 0 1
Output
4
Note
In the first case, flip the segment from 2 to 5 (i = 2, j = 5). That flip changes the sequence, it becomes: [1 1 1 0 1]. So, it contains four ones. There is no way to make the whole sequence equal to [1 1 1 1 1].
In the second case, flipping only the second and the third element (i = 2, j = 3) will turn all numbers into 1.
The question : Yes n card , Only 0 and 1, Ask at [i,j] Flip once within the range to make 1 The most .
Output 1 The maximum number of cards
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main()
{
int n,i,j,k,t;
int a[110];
int sum[2];
int cnt=0;
while(~scanf("%d",&n))
{
cnt=0;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]==1)
cnt++;// At the beginning of recording 1 Number of cards
}
t=cnt;
if(cnt==n)
{
printf("%d\n",n-1);// Suppose it's all 1 Words You have to turn a card So the maximum number left is the total number -1
}
else
{
for(i=0; i<n; i++)
for(j=i; j<n; j++)
{
memset(sum,0,sizeof(sum));
for(k=i; k<=j; k++)
sum[a[k]]++;
if(sum[0]>sum[1])
{
if(cnt<t+sum[0]-sum[1])
{
cnt=t+sum[0]-sum[1];
}
}
}
printf("%d\n",cnt);
}
}
return 0;
}
Publisher : Full stack programmer stack length , Reprint please indicate the source :https://javaforall.cn/116604.html Link to the original text :https://javaforall.cn
边栏推荐
- Antisamy: a solution against XSS attack tutorial
- 咋吃都不胖的朋友,Nature告诉你原因:是基因突变了
- 6. About JWT
- How to choose the appropriate automated testing tools?
- 高考填志愿规则
- "Decryption" Huawei machine vision Corps: Huawei is moving up and the industry is moving forward
- 如何选择合适的自动化测试工具?
- Reinforcement learning - learning notes 8 | Q-learning
- String type, constant type and container type of go language
- 【Base64笔记】「建议收藏」
猜你喜欢
[C language] string function
Cadre de validation des données Apache bval réutilisé
【软件测试】从企业版BOSS直聘,看求职简历,你没被面上是有原因的
Policy mode - unity
[Blue Bridge Cup training 100 questions] sort scratch from small to large. Blue Bridge Cup scratch competition special prediction programming question centralized training simulation exercise question
[tpm2.0 principle and Application guide] Chapter 16, 17 and 18
2022上半年朋友圈都在传的10本书,找到了
微服务远程Debug,Nocalhost + Rainbond微服务开发第二弹
ES6笔记一
RISCV64
随机推荐
RIP和OSPF的区别和配置命令
[tpm2.0 principle and Application guide] Chapter 9, 10 and 11
行业案例|数字化经营底座助力寿险行业转型
高考填志愿规则
【剑指 Offer】59 - I. 滑动窗口的最大值
gsap动画库
Do you know all four common cache modes?
如何选择合适的自动化测试工具?
Thread pool and singleton mode and file operation
[unity shader] insert pass to realize the X-ray perspective effect of model occlusion
SD_ DATA_ RECEIVE_ SHIFT_ REGISTER
[C language] string function
Learn open62541 -- [67] add custom enum and display name
Reject policy of thread pool
ES6 note 1
伺服力矩控制模式下的力矩目标值(fTorque)计算
Where does brain hole come from? New research from the University of California: creative people's neural connections will "take shortcuts"
Will low code help enterprises' digital transformation make programmers unemployed?
Desci: is decentralized science the new trend of Web3.0?
面试唯品会实习测试岗、抖音实习测试岗【真实投稿】