Cod sursa(job #1024657)

Utilizator danutbodbodnariuc danut danutbod Data 8 noiembrie 2013 22:18:06
Problema Secventa Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.32 kb
//var II 100p cu parsare
#include <fstream>
#define NMax 1000003
using namespace std;
ifstream f("secventa.in");
ofstream g("secventa.out");
int a[NMax], deque[NMax],i,j,k,x,n,p,u,pi,pf,semn,maxi=-300000;
string s;
int main()
{
    f>>n>>k;f.get();
    getline(f,s);s=s+" ";
    x=0;semn=1;
    for(i=0; i<s.length(); i++)
      if(s[i]=='-')semn=-1;
        else if(s[i]>='0'&&s[i]<='9')x=x*10+s[i]-'0';
              else {a[++j]=semn*x;x=0;semn=1;}
    p=1;u=0;
    for(i=1; i<=n; i++)
    {
        while(p<=u && a[i]<a[deque[u]]) u--;
        deque[++u]=i;
        if(deque[p]==i-k) p++;
        if(i>=k) if(maxi<a[deque[p]]){pi=i-k+1;pf=i;maxi=a[deque[p]];}
    }
    g<<pi<<" "<<pf<<" "<<maxi<<'\n';
    return 0;
}
////var I 80p fara parsare
//#include <fstream>
//#define NMax 1000003
//using namespace std;
//ifstream f("secventa.in");
//ofstream g("secventa.out");
//int a[NMax], deque[NMax],i,k,n,p,u,pi,pf,maxi=-300000;
//int main()
//{
//    f>>n>>k;
//    for(i=1; i<=n; i++) f>>a[i];
//    p=1;u=0;
//    for(i=1; i<=n; i++)
//    {
//        while(p<=u && a[i]<a[deque[u]]) u--;//<=  ??????
//        deque[++u]=i;
//        if(deque[p]==i-k) p++;
//        if(i>=k) if(maxi<a[deque[p]]){pi=i-k+1;pf=i;maxi=a[deque[p]];}
//    }
//    g<<pi<<" "<<pf<<" "<<maxi<<'\n';
//    return 0;
//}