Breaking News: Grepper is joining You.com. Read the official announcement!

Maximum sum of i*arr[i] among all rotations of a given array

pacniccoder answered on July 18, 2022 Popularity 3/10 Helpfulness 1/10

answer Maximum sum of i*arr[i] among all rotations of a given array

Maximum sum of i*arr[i] among all rotations of a given array

Comment

//Find maximum value of Sum( iarr[i]) with only rotations on given array allowed
#include <iostream>
#include <math.h>
using namespace std;
int fact(int n){
    int nfac=1;
    for(int i=n;i>0;i--){
        nfac*=i;
    }
    return nfac;
}
int maxofarray(int arr[],int n){
     int  largest=arr[0];
for(int i=0;i<n;i++){
        largest=max(largest,arr[i]);
    }
    return largest;
}
int sumofarray(int A[],int n){
    int sum=0;
    for(int i=0;i<n;i++){
        sum+=A[i]*i;
    }
    return sum;
}
void print(int A[],int n){
    for(int i=0;i<n;i++){
        cout<<A[i]<<" ";
    }
    cout<<endl;
}
int main()
{
    int n=10,largest; cin>>n;
    int arr[]={10, 1, 2, 3, 4, 5, 6, 7, 8, 9};
    int p=1;
    largest=maxofarray(arr,n); //find the max of the array;
    cout<<"max of the array"<<largest<<endl;
    while(p<=fact(n)){   //while loop runs for n! times;
        int temp=arr[0];
        for(int i=0;i<n-1;i++){
            arr[i]=arr[i+1];    //right rotation of the elements of the array;
        }
         arr[n-1]=temp;           //first element as the last element of the array;
         print(arr,n);
         p++;
         if(arr[n-1]==largest){  //if the largest element is at the last then sum of the array 
             break;              //element is the maximum 
         }
         
    }
    cout<<sumofarray(arr,n); // print the sum of the array element

    return 0;
}

Popularity 3/10 Helpfulness 1/10 Language whatever

Source: Grepper

Tags: sum whatever

Link to this answer
Share Copy Link

Contributed on Jul 18 2022

pacniccoder

0 Answers Avg Quality 2/10

Maximum sum of i*arr[i] among all rotations of a given array

Contents

More Related Answers

Maximum sum of i*arr[i] among all rotations of a given array

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.