#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
typedef long long ll;
void speed()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
const int maxn = 3e5 + 10;
int n, q;
ll d[maxn];
void solve()
{
cin >> n >> q;
for (int i = 1; i <= n; i ++)
cin >> d[i];
for (int i = 1; i <= q; i ++)
{
int type, l, r, s, c;
cin >> type >> l >> r;
if (type == 1)
{
cin >> s >> c;
for (int j = l; j <= r; j ++)
d[j] += s + (j - l) * c;
}
else
if (type == 2)
{
cin >> s >> c;
for (int j = l; j <= r; j ++)
d[j] = s + (j - l) * c;
}
else
{
int len = 1, ans = 0;
for (int j = l + 2; j <= r; j ++)
{
if (d[j] - d[j - 1] == d[j - 1] - d[j - 2])
len ++;
else
{
ans = max(ans, len);
len = 1;
}
}
ans = max(ans, len);
cout << ans + 1 << endl;
}
/**for (int j = 1; j <= n; j ++)
cout << d[j] << " ";
cout << endl;*/
}
}
int main()
{
speed();
solve();
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3068 ms |
5204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
131 ms |
9716 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
221 ms |
12460 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
131 ms |
9716 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3068 ms |
5204 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |