#include<bits/stdc++.h>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
int n,q;
cin >> n >> q;
vector<int>a(n+1,0);
vector<long long>b(n+1,0);
for(int i = 1;i<=n;i++)
{
cin >> a[i];
b[i] = a[i] -a[i-1];
}
int flag = 2;
int temp =2;
int c = b[2];
for(int i = 3;i<=n;i++)
{
if(b[i] == c)
{
temp++;
flag = max(flag,temp);
}
else
{
c = b[3];
temp = 1;
}
}
while(q--)
{
int k;
int r,l,s,c;
cin >> k;
if(k == 1)
{
cin >> l >> r >> s >> c;
}
else if (k==2)
{
cin >> l >> r >> s >> c;
flag = n;
}
else
{
cin >> l >> r;
cout << flag << '\n';
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
222 ms |
12372 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
416 ms |
10832 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
226 ms |
13908 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
416 ms |
10832 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
222 ms |
12372 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |