首页 > 代码库 > E - Tears of Drowned
E - Tears of Drowned
Description
Tia Dalma: Come. What service may I do you? You know I demand payment.
Jack: I brought payment. Look. An undead monkey. Top that.
Tia Dalma: The payment is fair.
Jack: I brought payment. Look. An undead monkey. Top that.
Tia Dalma: The payment is fair.
Old Captain Jack Sparrow’s friend Tia Dalma, the fortuneteller and prophetess, often makes potions. She has an outstanding collection of the rarest ingredients such as rat tails, fingers of drowned, tears of virgins and so on. And all these ingredients require special care.
Recently Tia Dalma received some good skins of bats as a payment, and now she wants to dry them. To dry ingredients fortuneteller usually uses specially prepared books as the magical properties of the skins could be lost during prolonged contact with other objects. Tia Dalma knows how many sheets should be on both sides of the skin to save it unspoiled. For a i-th skin that number is ai, that is, the distance from it to the neighboring skins and the book cover can’t be less than ai sheets. Help a fortuneteller determine the minimum number of sheets that should be in the book to save rare ingredients from damage.
Input
The first line contains integer n that is the number of skins (1 ≤ n ≤ 100). The second line contains n integers ai (1 ≤ ai ≤ 100).
Output
Output the minimal required number of sheets in the book.
Sample Input
input | output |
---|---|
35 10 3 |
#include<iostream>#include<cstdio>#include<string.h>#include<algorithm>using namespace std;int main(){ int n; int a[101]; int sum; while(scanf("%d",&n)!=EOF) { for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n); sum=0; for(int i=0;i<n;i++) sum+=a[i]; sum+=a[n-1]; printf("%d\n",sum); } return 0;}
读题吧 亲~~~ 看我下次还能不能读懂!!!!!!!!!!!!!!!!
E - Tears of Drowned
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。