F - The MAX（sort）

最新推荐文章于 2025-02-10 19:12:59 发布

原创最新推荐文章于 2025-02-10 19:12:59 发布 · 333 阅读

0 ·

CC 4.0 BY-SA版权

2.sort+结构体专栏收录该内容

11 篇文章

订阅专栏

本文介绍了一个名为F-TheMAX的问题解决思路与算法实现。通过给定一组整数，该算法旨在寻找最大的F值。文章提供了完整的C++代码实现，包括输入处理、计算逻辑及输出结果等关键步骤。

F - The MAX（sort）

Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
Submit

Status
Description
Giving N integers, V1, V2,,,,Vn, you should find the biggest value of F.

Input
Each test case contains a single integer N (1<=N<=100). The next line contains N integers, meaning the value of V1, V2….Vn.(1<= Vi <=10^8).The input is terminated by a set starting with N = 0. This set should not be processed.

Output
For each test case, output the biggest value of F you can find on a line.

Sample Input
2
1 2
0

Sample Output
4017

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;

int a[1111];

int max(long long a,long long b)
{
    return a>b?a:b;
}

int main()
{

    long long s,i,j,m,n,cnt,k=0,c,l;//数据短吗 为毛溢出
    while(scanf("%lld",&n),n)
    {
        s=0;
        m=0;
        for(i=1;i<=n;++i)
        {
            cin>>a[i];
            s+=a[i];
            m=max(a[i],m);
        }

        s+=m*(2009-n+1)-m;

        cout<<s<<endl;
    }
    return 0;
}