Photoshoot

题目描述
Farmer John is lining up his N cows (2≤N≤103), numbered 1…N, for a photoshoot. FJ initially planned for the i-th cow from the left to be the cow numbered ai, and wrote down the permutation a1,a2,…,aN on a sheet of paper. Unfortunately, that paper was recently stolen by Farmer Nhoj!
Luckily, it might still possible for FJ to recover the permutation that he originally wrote down. Before the sheet was stolen, Bessie recorded the sequence b1,b2,…,bN−1 that satisfies bi=ai+ai+1 for each 1≤i<N.
based on Bessie’s information, help FJ restore the “lexicographically minimum” permutation a that could have produced b. A permutation x is lexicographically smaller than a permutation y if for some j, xi=yi for all i<j and xj<yj (in other words, the two permutations are identical up to a certain point, at which x is smaller than y). It is guaranteed that at least one such a exists.
输入
The first line of input contains a single integer N.
The second line contains N−1 space-separated integers b1,b2,…,bN−1.
输出
A single line with N space-separated integers a1,a2,…,aN.
样例输入

5
4 6 7 6

样例输出

3 1 5 2 4

提示
a produces b because 3+1=4, 1+5=6, 5+2=7, and 2+4=6.

解题思路
暴力枚举第一位数

AC代码

#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int a[maxn];
int b[maxn];
int vis[maxn];
int main()
{int n;scanf("%d",&n);for(int i=2;i<=n;++i){scanf("%d",&b[i]);}for(int i=1;i<=n;++i){a[1]=i;int f=0;for(int j=2;j<=n;++j){int temp=b[j]-a[j-1];if(temp<=n&&temp>=1&&vis[temp]!=i){a[j]=temp;vis[temp]=i;}else{f=1;break;}}if(f) continue;else break;}for(int i=1;i<=n;++i) printf("%d%c",a[i],i==n?'\n':' ');return 0;
}

Photoshoot相关推荐

2020 GDUT Rating Contest III H. Photoshoot
H. Photoshoot 链接题目描述有n头牛,他们的序号从为1-n,现在他们按一定顺序排好,给出每对相邻的两头牛的序号之和,求出牛现在的序号. 题目分析因为确定其中一头牛的序号,就可以得出所 ...
Photoshoot（模拟）
题目描述 Farmer John is lining up his N cows (2≤N≤103), numbered 1-N, for a photoshoot. FJ initially pla ...
Photoshoot（2020jan铜牌）C++
Photoshoot Farmer John 在给他编号为 1-N的 N头奶牛排队拍照(2≤N≤103).FJ 一开始计划从左向右数第 i 个位置排编号为 ai的奶牛,他在一张纸上写下了排列 a1,a ...
A. Marin and Photoshoot
A. Marin and Photoshoot 题意: 插入最少的1使得任意长度大于2的连续子串中1的个数不少于0. 题解: 考虑最短不满足条件的字符串可能的形式: 1.00 2. 010 考虑使得每 ...
2020寒假集训排位赛 Photoshoot 题解（思维，枚举）
专题链接:https://codeforces.com/group/5yyKg9gx7m/contest/270203/problem/H 思路枚举a数组第一个数的值,即可推出后面所有的数注意不要 ...
24个为Web开发人员准备的CSS3实用教程
本文搜集了一些关于CSS3的最新教程.你可以根据这些教程或技术来实现网页设计,包括:文字阴影.圆角框.盒模型尺寸计算(box sizing).透明效果处理.多重背景.边框图像等.以下这些都是非常实用的 ...
39个超实用jQuery实例应用特效
2019独角兽企业重金招聘Python工程师标准>>> 1.Contextual Slideout:上下文滑动特效 2.Revealing Photo Slider:图片幻灯片特效 ...
14个jQuery图片放大编辑插件汇总
基于Web的在线应用已经是一个逐步成熟的趋势,Web应用的丰富多样化,都是基于 JavaScript框架完成的,其中 jQuery 框架被越来越多的Web开发者青睐,它可以让你"少写,多做& ...
USACO 2022 US Open Contest, Bronze
Problem 1. Photoshoot 迫切希望在郡县集市上赢得最佳奶牛摄影师的 Farmer John 正在尝试为他的 NN 头奶牛拍摄一张完美的照片(2≤N≤2⋅10^5,N 为偶数). Fa ...

Photoshoot

Photoshoot

Photoshoot相关推荐

最新文章

热门文章