当前位置:网站首页>Flipping Game(枚举)
Flipping Game(枚举)
2022-07-07 16:53:00 【全栈程序员站长】
大家好,又见面了,我是全栈君。
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.
题意:有n张牌,仅仅有0和1,问在[i,j]范围内翻转一次使1的数量最多。
输出1最多的牌的数量
#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++;//记录開始时1的牌数
}
t=cnt;
if(cnt==n)
{
printf("%d\n",n-1);//假设全是1的话 你得翻一张牌 所以剩下的最大数为总数-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;
}
发布者:全栈程序员栈长,转载请注明出处:https://javaforall.cn/116604.html原文链接:https://javaforall.cn
边栏推荐
- Discuss | what preparations should be made before ar application is launched?
- Some key points in the analysis of spot Silver
- 企业展厅设计中常用的三种多媒体技术形式
- Desci: is decentralized science the new trend of Web3.0?
- Will domestic software testing be biased
- Static routing configuration
- 你真的理解粘包与半包吗?3分钟搞懂它
- Will low code help enterprises' digital transformation make programmers unemployed?
- 体总:安全有序恢复线下体育赛事,力争做到国内赛事应办尽办
- A few simple steps to teach you how to see the K-line diagram
猜你喜欢
Industry case | digital operation base helps the transformation of life insurance industry
[C language] string function
[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
App capture of charles+drony
Learn open62541 -- [67] add custom enum and display name
Kirk Borne的本周学习资源精选【点击标题直接下载】
AntiSamy:防 XSS 攻击的一种解决方案使用教程
能同时做三个分割任务的模型,性能和效率优于MaskFormer!Meta&UIUC提出通用分割模型,性能优于任务特定模型!开源!...
【C语言】字符串函数
数据验证框架 Apache BVal 再使用
随机推荐
IP netns command (memo)
清华、剑桥、UIC联合推出首个中文事实核查数据集:基于证据、涵盖医疗社会等多个领域
Five network IO models
Cloud security daily 220707: Cisco Expressway series and telepresence video communication server have found remote attack vulnerabilities and need to be upgraded as soon as possible
简单几步教你如何看k线图图解
标准ACL与扩展ACL
如何给“不卖笔”的晨光估值?
“解密”华为机器视觉军团:华为向上,产业向前
Wireshark analyzes packet capture data * cap
Wireshark分析抓包数据*.cap
Rules for filling in volunteers for college entrance examination
Kirk Borne的本周学习资源精选【点击标题直接下载】
Differences between rip and OSPF and configuration commands
I feel cheated. Wechat tests the function of "size number" internally, and two wechat can be registered with the same mobile number
gsap动画库
A few simple steps to teach you how to see the K-line diagram
国内的软件测试会受到偏见吗
sqlite sql 异常 near “with“: syntax error
2022年推荐免费在线接收短信平台(国内、国外)
【剑指 Offer】59 - I. 滑动窗口的最大值