Cod sursa(job #1026268)
| Utilizator | Data | 11 noiembrie 2013 14:19:05 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
using namespace std;
ifstream in("secv2.in");
ofstream out("secv2.out");
int min(int a, int b)
{
if(a>b)
return b;
else
return a;
}
int main()
{
int n,k,i,S[100],V[100],Smin,Su,dr,st;
in>>n>>k;
for(i=1; i<=n; i++)
in>>V[i];
S[0]=0;
Smin=10000;
Su=-10000;
for(i=1; i<=n; i++)
S[i]=S[i-1]+V[i];
for(i=k; i<=n; i++)
{
Smin=min(Smin, S[i-1]);
if(S[i]-Smin>Su)
{
Su=S[i]-Smin;
dr=i;
for(st=1; st<=n; st++)
if(Smin==S[st]) break;
}
}
out<<st+1<<" "<<dr<<" "<<Su;
}
