-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathQ1345.cpp
91 lines (60 loc) · 1.01 KB
/
Q1345.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include <iostream>
#include <cmath>
#include <vector>
using namespace std;
double low = 21e8;
double high = -21e8;
int n;
int a0;
double answer;
int sum;
void solution(int s, int i) {
if (answer == -1)
return;
double now_low = (s - a0) / (double(i + 1));
double now_high = (s - a0 + 1) / (double(i + 1));
if (i == 0) {
low = now_low;
high = now_high;
return;
}
if (now_low >= high) {
answer = -1;
return;
}
if (now_high <= low) {
answer = -1;
return;
}
low = max(low, now_low);
high = min(high, now_high);
}
void input() {
cin >> n >> a0;
for (int i = 0; i < n; ++i) {
int s;
cin >> s;
solution(s, i);
}
}
void chkanswer() {
if (n == 0) {
cout << "0.0";
return;
}
if (answer == -1) {
cout << answer;
return;
}
if (high <= 0 || low < 0) {
cout << -1;
return;
}
cout << fixed;
cout.precision(9);
cout << low;
}
int main() {
input();
chkanswer();
}