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