EOF 440 Buying Feed （未提交）

囧……在EOJ里怎么找不到提交的地方？求问，哪里有提交这道题的地方？

不过把代码写出来了

#include <iostream>
#include <algorithm>
using namespace std;

struct MQ
{
    int pos[101];
    long long val[101];
    int head, tail, winlen;
    void reset(const int& _winlen)
    {
        head = 0, tail = -1, winlen = _winlen;
    }
    void push_back(const int& index, const long long& _val)
    {
        while(head <= tail && pos[tail] > _val)
            tail--;
        pos[++tail] = index;
        val[tail] = _val;
        while(index - pos[head] >= winlen)
            head++;
    }
    long long top()
    {
        return val[head];
    }
}q;
struct Store
{
    int x, f, c;
}s[101];
bool cmp(const Store& a, const Store& b)
{
    return a.x < b.x;
}
long long K, E, N, dp[101][101];

/*void Print()
{
    for(int i=0 ; i<=N ; i++)
    {
        for(int j=0 ; j<=K ; j++)
            cout << dp[i][j] << " ";
        cout << endl;
    }
    cout << endl;
}*/

int main()
{
    int t;    cin >> t;
    while(t--)
    {
        cin >> K >> E >> N;
        for(int i=1 ; i<=N ; i++)
        {
            cin >> s[i].x >> s[i].f >> s[i].c;
        }
        sort(s+1, s+1+N, cmp);
        for(int j=1 ; j<=K ; j++)
            dp[0][j] = 0xfffffff;
        dp[0][0] = 0;
        for(int i=1 ; i<=N ; i++)
        {
            q.reset(s[i].f+1);
            for(int j=0 ; j<=K ; j++)
            {
                dp[i][j] = 0xfffffff;
                q.push_back(j, dp[i-1][j]+j*j*(s[i].x-s[i-1].x)-j*s[i].c);
                dp[i][j] = q.top() + j * s[i].c;
            }
        }
        cout << dp[N][K]+K*K*(E-s[N].x) << endl;
    }
}