Cod sursa(job #783817)
Utilizator | Iacobescu Ovidiu ovidiu28 | Data | 4 septembrie 2012 10:22:15 |
---|---|---|---|
Problema | Transport | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<fstream>
using namespace std;
ifstream f("transport.in");
ofstream g("transport.out");
long n,k,i,maxx,s,v[16001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
s=0;
maxx=0;
for(i=1;i<=n/3;i++)
{ s=s+v[i];
if(v[i]>maxx)
maxx=v[i];
}
s=0;
for(i=n/3+1;i<=(n/3)*2+1;i++)
{ s=s+v[i];
if(v[i]>maxx)
maxx=v[i];
}
for(i=(n/3)*2+2;i<=n;i++)
{ s=s+v[i];
if(v[i]>maxx)
maxx=v[i];
}
g<<maxx;
f.close();
g.close();
return 0;
}