Submission #1022734

#TimeUsernameProblemLanguageResultExecution timeMemory
1022734Rolo678Progression (NOI20_progression)C++14
0 / 100
372 ms4456 KiB
#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[i]; 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 << 1 << '\n'; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...