-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPaparazzi-Gennady.cpp
59 lines (48 loc) · 1.27 KB
/
Paparazzi-Gennady.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
// https://www.codechef.com/MARCH21C/problems/PAPARAZI
#include <bits/stdc++.h>
#define lli long long int
using namespace std;
class Mydata {
public:
lli x;
lli y;
};
void solution() {
double Val1, Val2;
lli N, ans = 1, Mysize; cin >> N;
Mydata d[N];
vector<Mydata> v;
for (lli i = 0; i < N ; i++) {
cin >> d[i].y;
d[i].x = i+1;
}
v.push_back(d[0]);
v.push_back(d[1]);
Mysize = v.size();
if (N==2) ans = 1;
else {
for (lli i=2; i < N; i++) {
while(v.size()>=2) {
Val1 = ((double)v[Mysize-1].y - (double)v[Mysize-2].y)/((double)v[Mysize-1].x - (double)v[Mysize-2].x);
Val2 = ((double)d[i].y - (double)v[Mysize-1].y)/((double)d[i].x - (double)v[Mysize-1].x);
if (Val1<= Val2) {
v.pop_back();
Mysize--;
}else break;
}
v.push_back(d[i]);
Mysize++;
if (ans < (v[Mysize-1].x - v[Mysize-2].x)) ans = v[Mysize-1].x - v[Mysize-2].x;
}
}
v.clear();
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
long test; cin >> test;
while (test--) solution();
return 0;
}