-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathMarathonWinner.cpp
More file actions
57 lines (56 loc) · 852 Bytes
/
Copy pathMarathonWinner.cpp
File metadata and controls
57 lines (56 loc) · 852 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include<bits/stdc++.h>
using namespace std;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif
int n,t;
cin>>n>>t;
int a[n][t+1];
int m[n];
for(int i=0;i<n;i++){
for(int j=0;j<t+1;j++){
if(j==0){
a[i][j]=0;
}else{
cin>>a[i][j];
}
}
cin>>m[i];
}
int mxi[n]={0};
for(int i=2;i<t;i+=2){
int max=0;
for(int j=0;j<n;j++){
a[j][i]=m[j]*(a[j][i]+a[j][i-1])+a[j][i-2];
if(a[j][i]>max){
max=a[j][i];
}
}
for(int j=0;j<n;j++){
if(a[j][i]==max){
mxi[j]+=1;
}
}
}
int max=0;
int mxiarr[n]={0},l=0;
for(int i=0;i<n;i++){
if(mxi[i]>max){
max=mxi[i];
mxiarr[l]=i;
l++;
}
}
int mxx=0,ri;
max=0;
for(int i=0;i<l;i++){
if(a[mxiarr[i]][1]>max){
mxx=a[mxiarr[i]][1];
ri=mxiarr[i];
}
}
cout<<ri+1<<endl;
return 0;
}