1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; long long g,n,m,y,a[1000005]; int main() { cin>>g; while(g--) { fill(a,a+1000005,0); cin>>n>>m>>y; long long tmp=0; for(long long i=0;i<n;i++) { long long w=(i*i+4*i+7)%m; a[i]=w; } // for(int i=1;i<=n;i++) // cout<<a[i]<<" "; // cout<<endl; for(int i=0;i<y;i++) tmp+=a[i]; long long da=tmp,xiao=tmp; int dat=0,xiaot=0; for(int i=0,j=y;j<n;i++,j++) { tmp=tmp-a[i]+a[j]; if(tmp>=da) da=tmp,dat=i+1; if(tmp<xiao) xiao=tmp,xiaot=i+1; } cout<<xiaot<<" "<<dat<<endl; } return 0; }
- 1
Information
- ID
- 897
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By