Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- int i,j,k,r,l,c,m,N,pomN,br,kol,pkol;
- cin>>N;
- int a[N];
- long s[(N*(N+1))/2];
- for(i=0;i<N;i++)
- cin>>a[i];
- m=0;
- pomN=N;
- for(j=0;j<N;j++){
- s[m]=a[j];
- r=0;
- for(k=j+1;k<N;k++){
- r++;
- s[r+m]=s[r+m-1]+a[k];
- }
- m+=pomN;
- pomN--;
- }
- /* for(l=0;l<((N*(N+1))/2);l++)
- cout<<s[l]<<" ";
- cout<<endl;
- */
- br=0;
- kol=1;
- for(l=0;l<((N*(N+1))/2);l++){
- if(s[l]==-1){}
- else{
- pkol=1;
- for(c=l+1;c<((N*(N+1))/2);c++){
- if(s[c]==s[l]){
- pkol++;
- s[c]=-1;
- }
- }
- if(pkol>kol){
- br=s[l];
- kol=pkol;
- }
- else if((pkol==kol)&&(s[l]>br))
- br=s[l];
- }
- }
- cout<<br<<" "<<kol<<endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment