Submission #576186

---

Source Code Expand

#include <iostream>
using namespace std;
#include <math.h>


int main(void){

    int N;
    cin >> N;
    int *s = new int[N];
    for(int i = 0 ; i < N ; i++){
	cin >> s[i];
    }

    int *ao = new int[N*N];
    int *tk = new int[N*N];
    for(int i = 0 ; i < N ; i++){
			for(int j = 0 ; j < N ; j++){
			    ao[i*N + j] = 0;
			    tk[i*N + j] = 0; 
			    if(i != j){
						int start,end;
						if(i < j){
							start = i;
							end = j;
						}else{
							start = j;
							end = i;
						}

						int  count = 1;
						for(int k = start ; k < end+1 ; k++ ){
						    if(count % 2 == 1){
									tk[i*N+j] += s[k]; 
						    }else{
									ao[i*N+j] += s[k];
						    }
						    count++;
						}
			    }
			}	
    }


    for(int i = 0 ; i < N*N ; i++){
		//	cout << tk[i] << " " << ao[i] << endl;
    }

    int *aoJ = new int[N];
    for(int i = 0 ; i < N ; i++){
			int firstAoJFlag = 1;
			int tmpAo;
			for(int j = 0 ; j < N ; j++){
			    if(i != j && firstAoJFlag == 1){
						aoJ[i] = j;
						tmpAo = ao[i*N+j];
						firstAoJFlag = 0;
			    }else if(i==j){
			    }else{
						if(tmpAo < ao[i*N+j]){
						    aoJ[i] = j;
						    tmpAo = ao[i*N+j];
						}
			    }
			}
    }

    int tkValue;
    for(int i = 0 ; i < N ; i++){
			if(i == 0){
			    tkValue = tk[i*N+aoJ[i]];
			}else if(tkValue < tk[i*N + aoJ[i]]){
			    tkValue = tk[i*N+aoJ[i]];
			}
    }
		cout << tkValue << endl;
    


    delete aoJ;
    delete[] s;
    delete[] ao;
    delete[] tk;

 return 0;
}

Submission Info

Judge Result