TopCoder SRM 678 Div2

TC也打了十几场了，好像没什么长进。。

T1 ThePhantomMenace

#include <bits/stdc++.h>
using namespace std;

class ThePhantomMenace {
public:
    int find( vector <int> doors, vector <int> droids );
};
int ThePhantomMenace::find(vector <int> doors, vector <int> droids) {
    int mx=0;
    for(int i=0;i<doors.size();i++){
        int mn=2e9;
        for(int j=0;j<droids.size();j++)
         mn=min(mn,abs(doors[i]-droids[j]));
        mx=max(mx,mn);
    }
    return mx;
}

T2 AttackOfTheClones

#include <bits/stdc++.h>
using namespace std;
const int N=2501;
int a[N],b[N];

class AttackOfTheClones {
public:
    int count( vector <int> firstWeek, vector <int> lastWeek );
};
int AttackOfTheClones::count(vector <int> firstWeek, vector <int> lastWeek) {
    int n=firstWeek.size();
    int mx=-10;
    for(int i=0;i<n;i++)
     b[lastWeek[i]]=i+1,a[firstWeek[i]]=i+1;
    for(int i=1;i<=n;i++)
     mx=max(mx,a[i]-b[i]);
    cout<<mx;
    return mx+1;
}

T3 RevengeOfTheSith

$f[i][j]$表示前$i$阶用了$j$次原力，DP即可，每次用都是尽量把高度平均分。

#include <bits/stdc++.h>
using namespace std;
const int N=51;
int f[N][N],a[N];

class RevengeOfTheSith {
public:
    int move( vector <int> steps, int T, int D );
};

int val(int L,int k,int D){
    //if (k==0)
    int d=L/k;
    //if (d*k==L) return (D-d)*(D-d)*k;
    int ans=0;
    if (d+1>D) ans+=L%k*(D-d-1)*(D-d-1);
    if (d>D) ans+=(k-L%k)*(D-d)*(D-d);
    return ans;
}

int RevengeOfTheSith::move(vector <int> steps, int T, int D) {
    memset(f,0x3f,sizeof f);
    f[0][0]=0;
    int n=steps.size();
    for(int i=1;i<=n;i++) a[i]=steps[i-1],a[i]+=a[i-1];
    for(int i=0;i<n;i++)
     for(int j=0;j<=i&&j<=T;j++)
      for(int k=0;j+k<=T&&i+k+1<=n;k++)
       f[i+k+1][j+k]=min(f[i+k+1][j+k],f[i][j]+val(a[i+k+1]-a[i],k+1,D));
    return f[n][T];
}