QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#364215#8242. V-Diagramucup-team1525#TL 1ms5976kbC++17975b2024-03-24 13:03:192024-03-24 13:03:20

Judging History

你现在查看的是最新测评结果

  • [2024-03-24 13:03:20]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:5976kb
  • [2024-03-24 13:03:19]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define double long double
const int N=3e5;
const double eps=1e-12;
int n;
double a[N+5];
double b[N+5];
bool check(double x){
    for(int i=1;i<=n;i++)
        b[i]=b[i-1]+a[i]-x;
    double mx=b[n],mn=0;
    for(int i=2;i<n;i++)
        if(a[i]<a[i-1]&&a[i]<a[i+1]){
            for(int j=1;j<i;j++)
                mn=min(mn,b[j]);
            for(int j=i+1;j<=n;j++)
                mx=max(mx,b[j]);
            // printf("%lf %lf\n",mx,mn);
            if(mx>mn+eps)
                return 1;
            return 0;
        }
    assert(0);
}
void solve(){
    long long ans=0;
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%LF",&a[i]);
    double l=0,r=1e9;
    while(r-l>eps){
        double mid=(l+r)/2;
        if(check(mid)) l=mid;
        else r=mid;
    }
    printf("%.13LF\n",l);
}
int main(){
    int t; scanf("%d",&t);
    while(t--) solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5976kb

input:

2
4
8 2 7 10
6
9 6 5 3 4 8

output:

6.7499999999996
5.8333333333326

result:

ok 2 numbers

Test #2:

score: -100
Time Limit Exceeded

input:

100000
3
948511478 739365502 813471668
3
881046825 27458122 398507422
3
987554257 399092415 924260278
3
984128569 125199021 716360525
3
529589236 45783262 313507287
3
645443456 85994112 226010681
3
914820717 228360911 572267310
3
418958362 56703604 195276041
3
64461646 26764720 26995581
3
914535039 ...

output:


result: